Summary of block A055
Sequences in block A055
Section titled “Sequences in block A055”-
A055002: Erroneous version of A000009.
-
A055010: a(0) = 0; for n > 0, a(n) = 3*2^(n-1) - 1.
-
A055017: Difference between sums of alternate digits of n starting with the last, i.e., (sum of ultimate digit of n, antepenultimate digit of n, …) - (sum of penultimate digit of n, preantepenultimate digit of n, …).
-
A055057: Largest k value that admits an (n,k) smooth magic carpet.
-
A055086: n appears 1+[n/2] times.
-
A055087: Integers 0..n then 0..n then 0..n+1 then 0..n+1 etc.
-
A055099: Expansion of g.f.: (1 + x)/(1 - 3*x - 2*x^2).
-
A055112: a(n) = n*(n+1)*(2*n+1).
-
A055156: Powers of 3 which are not powers of 3^3.
-
A055209: a(n) = Product_{i=0..n} i!^2.
-
A055214: a(0) = 1; a(n) = 2*n*a(n-1) - 1 for n >= 1.
-
A055232: Expansion of (1+2*x+3*x^2)/((1-x)^3*(1-x^2)).
-
A055264: Possible values of A055263; numbers equal to 0, 1, 3 or 6 modulo 9.
-
A055267: a(n) = 3*a(n-1) - a(n-2) with a(0)=1, a(1)=7.
-
A055269: a(n) = 4*a(n-1) - a(n-2) + 3 with a(0)=1, a(1)=7.
-
A055271: a(n) = 5*a(n-1) - a(n-2) with a(0)=1, a(1)=7.
-
A055272: First differences of 7^n (A000420).
-
A055273: a(n) = 3*a(n-1) - a(n-2) with a(0) = 1, a(1) = 8.
-
A055274: First differences of 8^n (A001018).
-
A055275: First differences of 9^n (A001019).
-
A055276: First differences of 11^n (A001020).
-
A055303: Number of labeled rooted trees with n nodes and 2 leaves.
-
A055315: Number of labeled trees with n nodes and 3 leaves.
-
A055389: a(0) = 1, then twice the Fibonacci sequence.
-
A055417: Number of points in N^n of norm <= 2.
-
A055437: a(n) = 10*n^2+n.
-
A055438: a(n) = 100*n^2 + n.
-
A055462: Superduperfactorials: product of first n superfactorials.
-
A055523: Longest other leg of a Pythagorean triangle with n as length of a leg.
-
A055533: Number of labeled order relations on n nodes in which longest chain has n-1 nodes.
-
A055541: Total number of leaves (nodes of vertex degree 1) in all labeled trees with n nodes.
-
A055555: a(n) = n!*(n!+1)/2.
-
A055562: a(n) = least number greater than a(n-1) not the sum of an earlier pair of consecutive terms, a(0) = 2.
-
A055568: Numbers not greater than the sum of digits of their squares.
-
A055580: Björner-Welker sequence: 2^n*(n^2 + n + 2) - 1.
-
A055585: Second column of triangle A055584.
-
A055588: a(n) = 3*a(n-1) - a(n-2) - 1 with a(0) = 1 and a(1) = 2.
-
A055590: a(n) = 3^(sum of a(i) where i<n).
-
A055591: a(n) = a(n-1)+3^a(n-1).
-
A055596: Expansion of e.g.f. (2 - x - 2*exp(-x))/(1-x).
-
A055601: Number of n X n binary matrices with no zero rows.
-
A055614: Number of isomorphism classes of complex filiform Lie algebras of dimension n.
-
A055627: From Vikram Seth’s novel, “A Suitable Boy”.
-
A055658: Number of (3,n)-partitions of a chain of length n^2.
-
A055746: Product of first n terms of A003046.
-
A055775: a(n) = floor(n^n / n!).
-
A055776: a(n) = a(n-1)^3 + a(n-1)^2 + a(n-1) + 1.
-
A055777: a(n) = 3^(3^n).
-
A055795: a(n) = binomial(n,4) + binomial(n,2).
-
A055802: a(n) = T(n,n-2), array T as in A055801.
-
A055808: a(n) and floor(a(n)/4) are both squares; i.e., squares that remain squares when written in base 4 and last digit is removed.
-
A055819: Row sums of array T in A055818; twice the odd-indexed Fibonacci numbers after initial term.
-
A055831: T(n,n-4), where T is the array in A055830.
-
A055841: Number of compositions of n into 3*j-1 kinds of j’s for all j >= 1.
-
A055842: Expansion of (1-x)^2/(1-5*x).
-
A055845: a(n) = 4*a(n-1) - a(n-2) with a(0)=1, a(1)=8.
-
A055849: a(n) = 3*a(n-1) - a(n-2) with a(0)=1, a(1)=9.
-
A055850: a(n) = 3*a(n-1) - a(n-2) with a(0)=1, a(1)=10.
-
A055860: a(n) = A000169(n+1) if n > 0; a(0) = 0.
-
A055861: Essentially A053506 but with leading 0 (instead of 1) and offset 0.
-
A055865: Second column of triangle A055864.
-
A055874: a(n) = largest m such that 1, 2, …, m divide n.
-
A055897: a(n) = n*(n-1)^(n-1).
-
A055937: a(n) = a(n-1) * a(n-2) - 1.
-
A055976: Remainder when (n-1)! + 1 is divided by n.
-
A055997: Numbers k such that k*(k - 1)/2 is a square.
-
A055998: a(n) = n*(n+5)/2.
-
A055999: a(n) = n*(n + 7)/2.