Skip to content

Summary of block A130

124 sequences
  • A130031: Row sums of triangle A129467.

  • A130032: Row sums of unsigned triangle A129467.

  • A130072: a(n) = 5^n - 3^n - 2^n.

  • A130076: Primes p such that p^2 divides 5^p - 3^p - 2^p.

  • A130102: E.g.f.: (e^x - x)^2.

  • A130103: Expansion of e.g.f. e^(2x)-(1+x)*e^x+x.

  • A130104: Expansion of x(1-3x+5x^2-2x^3)/((1-x)^3*(1-2x)).

  • A130129: a(n) = (3*n+1)*2^n.

  • A130130: a(0)=0, a(1)=1, a(n)=2 for n >= 2.

  • A130151: Period 6: repeat [1, 1, 1, -1, -1, -1].

  • A130195: Row sums of triangle A130194.

  • A130196: Period 3: repeat [1, 2, 2].

  • A130198: Single paradiddle. In percussion, the paradiddle is a four-note drum sticking pattern consisting of two alternating notes followed by two notes on the same hand.

  • A130213: Order of modular group of degree 3^(n-1) + 1.

  • A130214: Order of modular group of degree 5^(n-1)+1.

  • A130215: Order of modular group of degree 7^(n-1)+1.

  • A130216: a(0) = 3; a(n) = a(n-1) + (number of multiples of 3 so far in the sequence).

  • A130218: Partial sums of A100119. Sum of first n of the n-th centered n-gonal numbers.

  • A130233: a(n) is the maximal k such that Fibonacci(k) <= n (the “lower” Fibonacci Inverse).

  • A130237: The ‘lower’ Fibonacci Inverse A130233(n) multiplied by n.

  • A130241: Maximal index k of a Lucas number such that Lucas(k) <= n (the ‘lower’ Lucas (A000032) Inverse).

  • A130255: Maximal index k of an odd Fibonacci number (A001519) such that A001519(k) = Fibonacci(2k-1) <= n (the ‘lower’ odd Fibonacci Inverse).

  • A130380: Catalan numbers halved and rounded to the next integer.

  • A130423: Main diagonal of array A[k,n] = n-th sum of 3 consecutive k-gonal numbers, k>2.

  • A130427: Complete list of all 5 numbers n such that n is equal to the number of 5’s in the decimal digits of all numbers <= n.

  • A130431: Complete list of all 9 numbers n such that n is equal to the number of 9’s in the decimal digits of all numbers <= n.

  • A130449: a(0) = 1; a(n) = 4^(n+1)*a(n-1)+1.

  • A130472: A permutation of the integers: a(n) = (-1)^n * floor( (n+1)/2 ).

  • A130481: a(n) = Sum_{k=0..n} (k mod 3) (i.e., partial sums of A010872).

  • A130482: a(n) = Sum_{k=0..n} (k mod 4) (Partial sums of A010873).

  • A130483: a(n) = Sum_{k=0..n} (k mod 5) (Partial sums of A010874).

  • A130484: a(n) = Sum_{k=0..n} (k mod 6) (Partial sums of A010875).

  • A130485: a(n) = Sum_{k=0..n} (k mod 7) (Partial sums of A010876).

  • A130486: a(n) = Sum_{k=0..n} (k mod 8) (Partial sums of A010877).

  • A130487: a(n) = Sum_{k=0..n} (k mod 9) (Partial sums of A010878).

  • A130488: a(n) = Sum_{k=0..n} (k mod 10) (Partial sums of A010879).

  • A130489: a(n) = Sum_{k=0..n} (k mod 11) (Partial sums of A010880).

  • A130490: a(n) = Sum_{k=0..n} (k mod 12) (Partial sums of A010881).

  • A130494: Row sums of triangle A130478.

  • A130496: Repetition of even numbers five times.

  • A130497: Repetition of odd numbers five times.

  • A130505: a(n) = 3*a(n-1) if n is odd, otherwise 6*a(n-1).

  • A130508: a(1)=2. a(2)=3. a(3)=1. a(n+3) = 3 + a(n), for all positive integers n.

  • A130518: a(n) = Sum_{k=0..n} floor(k/3). (Partial sums of A002264.)

  • A130519: a(n) = Sum_{k=0..n} floor(k/4). (Partial sums of A002265.)

  • A130520: a(n) = Sum_{k=0..n} floor(k/5). (Partial sums of A002266.)

  • A130543: Multiplicative persistence of n!.

  • A130566: Pyramidal 47-gonal numbers.

  • A130567: Expansion of x*(2 - 7*x + 2*x^2)/((1-x)*(1-4*x)*(1-2*x)).

  • A130568: Generalized Beatty sequence 1+2*floor(n*phi), which contains infinitely many primes.

  • A130578: Number of different possible rows (or columns) in an n X n crossword puzzle.

  • A130589: a(n) = F(F(n)-1), where F(n) = A000045(n) (the Fibonacci numbers).

  • A130599: Transformation of sequence 3^k by sandwiching it between 1’s.

  • A130625: First differences of A130624.

  • A130630: Periodic sequence with period 1 1 1 1 1 0 0 0 0.

  • A130652: a(n) = 11^n - 2.

  • A130656: Interlacing n^3/2 and n^2(n + 1)/2.

  • A130657: Periodic (7 terms) 1 1 1 1 0 0 0.

  • A130658: Period 4: repeat [1, 1, 2, 2].

  • A130659: Period 4: repeat [0, 1, 2, 4].

  • A130683: Duplicate of A032184.

  • A130693: Powers of 2 whose digits are powers of 2.

  • A130706: a(0) = 1, a(1) = 2, a(n) = 0 for n > 1.

  • A130707: a(n+3) = 3*(a(n+2) - a(n+1)) + 2*a(n).

  • A130713: a(0)=a(2)=1, a(1)=2, a(n)=0 for n > 2.

  • A130716: a(0)=a(1)=a(2)=1, a(n)=0 for n>2.

  • A130722: The twice repeated nonnegative integers at even indices, the non-repeated nonnegative integers at odd indices.

  • A130724: a(n) = lcm(n,3) / gcd(n,3).

  • A130727: List of triples 2n+1, 2n+3, 2n+2.

  • A130729: Fermat numbers of order 3 or F(n,3) = 2^(2^n)+3.

  • A130730: Fermat numbers of order 7 or F(n,7) = 2^(2^n)+7.

  • A130731: Period 4: repeat [1, 2, 0, 0].

  • A130740: a(n) = 2^(4^n) + 5.

  • A130741: a(n) = 4^(4^n) + 3.

  • A130744: a(n) = n*(n+2)*n!.

  • A130748: Place n points on each of the three sides of a triangle, 3n points in all; a(n) = number of nondegenerate triangles that can be constructed using these points (plus the 3 original vertices) as vertices.

  • A130750: Binomial transform of A010882.

  • A130752: Binomial transform of periodic sequence (2, 3, 1).

  • A130755: Binomial transform of periodic sequence (3, 1, 2).

  • A130759: Partial sums of A130707.

  • A130764: ASCII codes for upper case letters.

  • A130765: ASCII codes for lower case letters.

  • A130766: 3n+2 sandwiched by tripled 3n+1 .

  • A130772: Periodic sequence with period 2 2 0 -2 -2 0.

  • A130773: a(0) = 0, a(1) = 2, a(n) = 2*n + 1 for n >= 2.

  • A130778: Period 6: repeat [1, -1, -3, -3, -1, 1].

  • A130779: a(0)=a(1)=1, a(2)=2, a(n)=0 for n >= 3.

  • A130781: Sequence is identical to its third differences: a(n+3) = 3*a(n+2) - 3*a(n+1) + 2*a(n), with a(0)=a(1)=1, a(2)=2.

  • A130784: Period 3: repeat [1, 3, 2].

  • A130785: Sequence identical to its third differences: a(n+3) = 3a(n+2)-3a(n+1)+2a(n), with a(0)=1, a(1)=4, a(2)=9.

  • A130793: Periodic sequence with period 3: 1, 3, 5.

  • A130794: Periodic sequence with period 1,5,3.

  • A130806: Period 6: 1,4,3,-1,-4,-3.

  • A130808: Magic side-sum constants of magic triangles of Yates using the numbers 1 to 9.

  • A130809: If X_1, …, X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 3-subsets of X containing none of X_i, (i=1,…,n).

  • A130810: If X_1,…,X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 4-subsets of X containing none of X_i, (i=1,…,n).

  • A130811: If X_1,…,X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 5-subsets of X containing none of X_i, (i=1,…n).

  • A130812: If X_1,…,X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 6-subsets of X containing none of X_i, (i=1,…n).

  • A130813: If X_1,…,X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 7-subsets of X containing none of X_i, (i=1,…n).

  • A130815: Period 6: repeat [1, 5, 4, -1, -5, -4].

  • A130819: 2*k appears 2*k-1 times.

  • A130821: 2n-1 appears 2n times.

  • A130822: Two 1’s, one 2, four 3’s, three 4’s …

  • A130823: Each odd number appears thrice.

  • A130824: a(n) = 2*A004273(n).

  • A130829: 2n+1 appears 2n times.

  • A130840: a(n) = floor((1/16)*(16 + 2^n - 8*n + 8*n^2)).

  • A130845: a(4n) = a(4n+1) = a(4n+2) = A001477(n), a(4n+3) = A005408(n).

  • A130848: Periodic sequence with period (2, 5, 3, -2, -5, -3).

  • A130861: a(n) = (n-1)*(2*n+5).

  • A130862: a(n) = (n-1)*(n+2)*(2*n+11)/2.

  • A130863: Ratio of quadruple Sum of k^2-1 to quadruple sum of k made into an integer sequence: (1/6)*(-1 + n)*(2 + n)*(3 + n)*(7 + n).

  • A130869: Partial sums of A130752.

  • A130876: Centered 1729-gonal numbers.

  • A130877: Numbers that are congruent to {0, 5} mod 9.

  • A130883: a(n) = 2*n^2 - n + 1.

  • A130884: 3n^3 + 2n^2 + n + 1.

  • A130885: 3n^3 - 2n^2 + n - 1.

  • A130886: 4n^4 + 3n^3 + 2n^2 + n + 1.

  • A130893: Lucas numbers (beginning with 1) mod 10.

  • A130909: Simple periodic sequence (n mod 16).

  • A130910: Partial sums of A130909.

  • A130917: a(n) is the sum of the digital roots of all of the previous terms.

  • A130974: Period 6: repeat [1, 1, 1, 3, 3, 3].