Summary of block A051
Sequences in block A051
Section titled “Sequences in block A051”-
A051009: Reduced denominators of Newton’s iteration for sqrt(2).
-
A051032: Summatory Rudin-Shapiro sequence for 2^(n-1).
-
A051049: Number of moves needed to solve an (n+1)-ring baguenaudier if two simultaneous moves of the two end rings are counted as one.
-
A051062: a(n) = 16*n + 8.
-
A051063: 27*n+9 or 27*n+18.
-
A051065: a(n) = A004128(n) mod 2.
-
A051069: A051068 read mod 2.
-
A051133: a(n) = binomial(2n,n)*n*(2n+1)/2.
-
A051154: a(n) = 1 + 2^k + 4^k where k = 3^n.
-
A051162: Triangle T(n,k) = n+k, n >= 0, 0 <= k <= n.
-
A051170: T(n,5), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 5 black beads and n-5 white beads.
-
A051176: If n mod 3 = 0 then n/3 else n.
-
A051179: a(n) = 2^(2^n) - 1.
-
A051188: Sept-factorial numbers.
-
A051189: Octo-factorial numbers.
-
A051191: a(n) = 2^(2^n-2).
-
A051232: 9-factorial numbers.
-
A051262: 10-factorial numbers.
-
A051274: Expansion of (1+x^4)/((1-x^2)*(1-x^3)).
-
A051275: Expansion of (1+x^2)/((1-x^2)*(1-x^3)).
-
A051285: a(1) = 1, a(2) = 2, a(n) = a(n-1)^a(n-2).
-
A051294: a(n) = F(n^2)/F(n), where F(n) = A000045(n) is the n-th Fibonacci number.
-
A051329: A generalized Thue-Morse sequence.
-
A051396: a(n) = (2*n-2)*(2*n-3)*a(n-1)+1.
-
A051398: a(n) = -(n-3)*a(n-1) + 2*(n-2)^2.
-
A051399: a(n) = (n-1)!*a(n-1)+1.
-
A051405: a(n) = (3^n+1)*(3^(n+1)+1)/4.
-
A051406: a(n) = (3^n+1) * (3^(n+1)+1) / 8.
-
A051407: a(n) = 3^n*(3^(n+1)+1)/2.
-
A051431: a(n) = (n+10)!/10!.
-
A051437: Number of undirected walks of length n+1 on an oriented triangle, visiting n+2 vertices, with n “corners”; the symmetry group is C3. Walks are not self-avoiding.
-
A051442: a(n) = n^(n+1)+(n+1)^n.
-
A051443: a(n) = n^(n+1)*(n+1)^n.
-
A051450: Number of positive rational knots with 2n+1 crossings.
-
A051460: Number of asymmetric types of Boolean functions of n variables under action of symmetric group.
-
A051481: a(n+1) = a(n)^2 + n*(n+3)*a(n).
-
A051490: a(n) = n^(n+2)*(n+2)^n.
-
A051500: a(n) = (3^n + 1)^2/4.
-
A051577: a(n) = (2*n + 3)!!/3 = A001147(n+2)/3.
-
A051578: a(n) = (2*n+4)!!/4!!, related to A000165 (even double factorials).
-
A051579: a(n) = (2*n+5)!!/5!!, related to A001147 (odd double factorials).
-
A051580: a(n) = (2*n+6)!!/6!!, related to A000165 (even double factorials).
-
A051581: a(n) = (2*n+7)!!/7!!, related to A001147 (odd double factorials).
-
A051582: a(n) = (2*n+8)!!/8!!, related to A000165 (even double factorials).
-
A051583: a(n) = (2*n+9)!!/9!!, related to A001147 (odd double factorials).
-
A051604: a(n) = (3*n+4)!!!/4!!!.
-
A051605: a(n) = (3*n+5)!!!/5!!!.
-
A051606: a(n) = (3*n+6)!!!/6!!!, related to A032031 ((3*n)!!! triple factorials).
-
A051607: a(n) = (3*n+7)!!!/7!!!.
-
A051608: a(n) = (3*n+8)!!!/8!!!.
-
A051609: a(n) = (3*n+9)!!!/9!!!, related to A032031 ((3*n)!!! triple factorials).
-
A051617: a(n) = (4*n+5)(!^4)/5(!^4), related to A007696(n+1) ((4*n+1)(!^4) quartic, or 4-factorials).
-
A051618: a(n) = (4*n+6)(!^4)/6(!^4).
-
A051619: a(n) = (4*n+7)(!^4)/7(!^4), related to A034176(n+1) ((4*n+3)(!^4) quartic, or 4-factorials).
-
A051620: a(n) = (4*n+8)(!^4)/8(!^4), related to A034177(n+1) ((4*n+4)(!^4) quartic, or 4-factorials).
-
A051621: a(n) = (4*n+9)(!^4)/9(!^4), related to A007696(n+1) ((4*n+1)(!^4) quartic, or 4-factorials).
-
A051622: a(n) = (4*n+10)(!^4)/10(!^4), related to A000407 ((4*n+2)(!^4) quartic, or 4-factorials).
-
A051624: 12-gonal (or dodecagonal) numbers: a(n) = n*(5*n-4).
-
A051633: a(n) = 5*2^n - 2.
-
A051637: Chromos with n colors.
-
A051662: House numbers: a(n) = (n+1)^3 + Sum_{i=1..n} i^2.
-
A051667: a(n) = 6*2^n - 4*n - 6.
-
A051669: a(n) = 11*2^n - 4*n - 10.
-
A051673: Cubic star numbers: a(n) = n^3 + 4*Sum_{i=0..n-1} i^2.
-
A051682: 11-gonal (or hendecagonal) numbers: a(n) = n*(9*n-7)/2.
-
A051687: a(n) = (5*n+6)(!^5)/6, related to A008548 ((5*n+1)(!^5) quintic, or 5-factorials).
-
A051688: a(n) = (5*n+7)(!^5)/7(!^5), related to A034323 ((5*n+2)(!^5) quintic, or 5-factorials).
-
A051689: a(n) = (5*n+8)(!^5)/8(!^5), related to A034300 ((5*n+3)(!^5) quintic, or 5-factorials).
-
A051690: a(n) = (5*n+9)(!^5)/9(!^5), related to A034301 ((5*n+2)(!^5) quintic, or 5-factorials).
-
A051691: a(n) = (5*n+10)(!^5)/10(!^5), related to A052562 ((5*n)(!^5) quintic, or 5-factorials).
-
A051711: a(0) = 1; for n > 0, a(n) = n!*4^n/2.
-
A051743: a(n) = (1/24)*n*(n + 5)*(n^2 + n + 6).
-
A051744: a(n) = n*(n+1)*(n^2+5*n+18)/24.
-
A051745: a(n) = n*(n^4 + 10*n^3 + 35*n^2 + 50*n + 144)/120.
-
A051746: a(n) = n(n+7)(n+1)(n^2+2n+12)/120.
-
A051754: Consider problem of placing N queens on an n X n board so that each queen attacks precisely 1 other. Sequence gives maximal number of queens.
-
A051755: Consider problem of placing N queens on an n X n board so that each queen attacks precisely 2 others. Sequence gives maximal number of queens.
-
A051756: Consider the problem of placing N queens on an n X n board so that each queen attacks precisely 3 others. Sequence gives maximal number of queens.
-
A051792: a(n) = (-1)^(n-1)*(a(n-1) - a(n-2)), a(1)=1, a(2)=1.
-
A051797: Partial sums of A007585.
-
A051799: Partial sums of A007587.
-
A051832: Numbers k such that (2*10^(5*k) - 10^(4*k) + 2*10^(3*k) + 10^(2*k) + 10^k + 1)/3 is prime.
-
A051842: Arbitrary point value assignment to the subjective ratings “terrible”, “poor”, “normal”, “good”, “excellent”. Has no mathematical explanation.
-
A051865: 13-gonal (or tridecagonal) numbers: a(n) = n*(11*n - 9)/2.
-
A051866: 14-gonal (or tetradecagonal) numbers: a(n) = n*(6*n-5).
-
A051867: 15-gonal (or pentadecagonal) numbers: n*(13n-11)/2.
-
A051868: 16-gonal (or hexadecagonal) numbers: a(n) = n*(7*n-6).
-
A051869: 17-gonal (or heptadecagonal) numbers: a(n) = n*(15*n-13)/2.
-
A051870: 18-gonal (or octadecagonal) numbers: a(n) = n*(8*n-7).
-
A051871: 19-gonal (or enneadecagonal) numbers: n(17n-15)/2.
-
A051872: 20-gonal (or icosagonal) numbers: a(n) = n*(9*n-8).
-
A051873: 21-gonal numbers: a(n) = n*(19n - 17)/2.
-
A051874: 22-gonal numbers: a(n) = n*(10*n-9).
-
A051875: 23-gonal numbers: a(n) = n(21n-19)/2.
-
A051876: 24-gonal numbers: a(n) = n*(11*n-10).
-
A051880: a(n) = binomial(n+4,4)*(2*n+1).
-
A051890: a(n) = 2*(n^2 - n + 1).
-
A051893: a(n) = Sum_{i=1..n-1} i^2*a(i), a(1) = 1.
-
A051895: Partial sums of second pentagonal numbers with even index (A049453).
-
A051898: Erroneous version of A002095.
-
A051922: Duplicate of A027810.
-
A051923: Partial sums of A051836.
-
A051924: a(n) = binomial(2*n,n) - binomial(2*n-2,n-1); or (3n-2)*C(n-1), where C = Catalan numbers (A000108).
-
A051925: a(n) = n*(2*n+5)*(n-1)/6.
-
A051927: Number of independent vertex sets in the n-prism graph Y_n = K_2 X C_n (n > 2).
-
A051936: Truncated triangular numbers: a(n) = n*(n+1)/2 - 9.
-
A051937: Truncated triangular pyramid numbers: a(n) = Sum_{k=4..n} (k*(k+1)/2 - 9).
-
A051938: Truncated triangular numbers: a(n) = n*(n+1)/2 - 18.
-
A051939: Truncated triangular pyramid numbers: a(n) = (n-5)*(n^2 + 8*n - 66)/6.
-
A051940: Truncated triangular numbers: n*(n+1)/2 - 3*t*(t+1)/2 with t=4.
-
A051941: Truncated triangular pyramid numbers: a(n) = (n-7)*(n^2 + 10*n - 108)/6, n >= 8.
-
A051942: a(n) = n*(n+1)/2 - 45.
-
A051943: Truncated triangular pyramid numbers: a(n) = Sum_{k=9..n} (k*(k+1)/2 - 45).
-
A051944: a(n) = C(n)*(4*n+1) where C(n) = Catalan numbers (A000108).
-
A051945: a(n) = C(n)*(5*n+1) where C(n) = Catalan numbers (A000108).
-
A051958: a(n) = 2*a(n-1) + 24*a(n-2), a(0)=0, a(1)=1.
-
A051960: a(n) = C(n)*(3n+2) where C(n) = Catalan numbers = A000108.