Summary of block A056
Sequences in block A056
Section titled “Sequences in block A056”-
A056000: a(n) = n*(n+9)/2.
-
A056001: a(n) = (n+1)*binomial(n+7, 7).
-
A056003: a(n) = (n+1)*binomial(n+8, 8).
-
A056006: Numbers k such that k | sigma(k) + 2.
-
A056014: a(n) = (Fibonacci(2n-1) - Fibonacci(n+1))/2.
-
A056020: Numbers that are congruent to +-1 mod 9.
-
A056021: Numbers k such that k^4 == 1 (mod 5^2).
-
A056040: Swinging factorial, a(n) = 2^(n-(n mod 2))*Product_{k=1..n} k^((-1)^(k+1)).
-
A056051: a(n) = (n-2)! - 1 (mod n).
-
A056081: Numbers that are congruent to {1, 26} mod 27.
-
A056082: Numbers k such that k^4 == 1 (mod 5^3).
-
A056084: Numbers k such that k^8 == 1 (mod 9^3).
-
A056105: First spoke of a hexagonal spiral.
-
A056106: Second spoke of a hexagonal spiral.
-
A056107: Third spoke of a hexagonal spiral.
-
A056108: Fourth spoke of a hexagonal spiral.
-
A056109: Fifth spoke of a hexagonal spiral.
-
A056114: Expansion of (1+9*x)/(1-x)^11.
-
A056115: a(n) = n*(n+11)/2.
-
A056119: a(n) = n*(n+13)/2.
-
A056121: a(n) = n*(n + 15)/2.
-
A056123: a(n) = 3*a(n-1) - a(n-2) with a(0)=1, a(1)=11.
-
A056124: a(n) = 3*a(n-1) - a(n-2) + 8 with a(0)=1, a(1)=11.
-
A056126: a(n) = n*(n + 17)/2.
-
A056136: Largest positive integer whose harmonic mean with another positive integer is n.
-
A056158: Equivalent of the Kurepa hypothesis for left factorial.
-
A056159: a(n) = floor(10^(n-1)/n).
-
A056165: e^[e^[e^ … [e^0] … ]], n high, where [] is “floor”.
-
A056182: First differences of A003063.
-
A056197: Diagonal of A056151.
-
A056199: a(n) = n * a(n-1) - Sum_{k=1..n-2} a(k) with a(1) = 0 and a(2) = 1.
-
A056207: Number of binary trees of height <= n.
-
A056220: a(n) = 2*n^2 - 1.
-
A056235: n*2^(n*2^n+n)-1.
-
A056236: a(n) = (2 + sqrt(2))^n + (2 - sqrt(2))^n.
-
A056237: a(n) = 2*n^2 + 9*n - 5.
-
A056287: Maximal AND-OR formula complexity (operator count) for n-input Boolean functions.
-
A056309: Number of reversible strings with n beads using exactly two different colors.
-
A056326: Number of reversible string structures with n beads using exactly two different colors.
-
A056449: a(n) = 3^floor((n+1)/2).
-
A056450: a(n) = (3*2^n - (-2)^n)/2.
-
A056451: Number of palindromes using a maximum of five different symbols.
-
A056452: a(n) = 6^floor((n+1)/2).
-
A056453: Number of palindromes of length n using exactly two different symbols.
-
A056469: Number of elements in the continued fraction for Sum_{k=0..n} 1/2^2^k.
-
A056486: a(n) = (9*2^n + (-2)^n)/4 for n>0.
-
A056487: a(n) = 5^(n/2) for n even, a(n) = 3*5^((n-1)/2) for n odd.
-
A056520: a(n) = (n + 2)*(2*n^2 - n + 3)/6.
-
A056527: Numbers where iterated sum of digits of square settles down to a cyclic pattern (in fact 13, 16, 13, 16, …).
-
A056530: Sequence remaining after third round of Flavius Josephus sieve; remove every fourth term of A047241.
-
A056541: a(n) = 2n*a(n-1) + 1 with a(0)=0.
-
A056542: a(n) = n*a(n-1) + 1, a(1) = 0.
-
A056543: a(n) = n*a(n-1) - 1 with a(1)=1.
-
A056545: a(n) = 4*n*a(n-1) + 1 with a(0)=1.
-
A056546: a(n) = 5*n*a(n-1) + 1 with a(0)=1.
-
A056547: a(n) = 6*n*a(n-1) + 1 with a(0)=1.
-
A056570: Third power of Fibonacci numbers (A000045).
-
A056571: Fourth power of Fibonacci numbers A000045.
-
A056572: Fifth power of Fibonacci numbers A000045.
-
A056573: Sixth power of Fibonacci numbers A000045.
-
A056574: Seventh power of Fibonacci numbers A000045.
-
A056578: a(n) = 1 + 2*n + 3*n^2 + 4*n^3.
-
A056579: 1+2n+3n^2+4n^3+5n^4.
-
A056585: Eighth power of Fibonacci numbers A000045.
-
A056586: Ninth power of Fibonacci numbers A000045.
-
A056587: Tenth power of Fibonacci numbers A000045.
-
A056594: Period 4: repeat [1,0,-1,0]; expansion of 1/(1 + x^2).
-
A056640: At stage 1, start with a unit square. At each successive stage add 4*(n-1) new squares around outside with edge-to-edge contacts. Sequence gives number of squares (regardless of size) at n-th stage.
-
A056699: First differences are 2,1,-2,3 (repeated).
-
A056771: a(n) = a(-n) = 34*a(n-1) - a(n-2), and a(0)=1, a(1)=17.
-
A056788: a(n) = n^n + (n-1)^(n-1).
-
A056810: Numbers whose fourth power is a palindrome.
-
A056822: Nearest integer to n^2/16.
-
A056826: Primes p such that (p^p + 1)/(p + 1) is a prime.
-
A056827: a(n) = floor(n^2/6).
-
A056829: Nearest integer to n^2/6.
-
A056830: Alternate digits 1 and 0.
-
A056833: Nearest integer to n^2/7.
-
A056834: a(n) = floor(n^2/7).
-
A056837: Duplicate of A001971.
-
A056838: a(n) = floor(n^2/9).
-
A056847: Nearest integer to n - sqrt(n).
-
A056849: Final digit of n^n.
-
A056854: a(n) = Lucas(4*n).
-
A056864: Nearest integer to n^2/10.
-
A056865: a(n) = floor(n^2/10).
-
A056914: a(n) = Lucas(4*n+1).
-
A056968: 10^(n-1) modulo n.
-
A056969: a(n) = 10^n modulo n.
-
A056991: Numbers with digital root 1, 4, 7 or 9.
-
A056992: Digital roots of square numbers A000290.