20062

Appears in sequences

• Number of balanced partitions of n: the largest part equals the number of parts.at n=54A047993
• a(n) = (Sum{k=0..n-1} a(k)) - a(n-3), with a(0)=0, a(1)=0, a(2)=1.at n=19A049856
• Subdiagonal of array of n-gonal numbers A081422.at n=27A081423
• Numbers k such that 2^(k(k-1)) == 8 (mod k).at n=5A126662
• a(n+1)-+a(n)=prime, a(n+1)*a(n)=Average of twin prime pairs, a(1)=3,a(2)=10.at n=31A154496
• Fibonacci sequence beginning 9, 7.at n=17A190995
• G.f.: A(x) = Sum_{n>=0} x^(n*(n+1)/2) / Product_{k=1..n} (1-x^k)^k.at n=32A206138
• Triangular array read by rows: T(n,k) is the number of compositions of n that have exactly k 3's; n>=0, 0<=k<=floor(n/3).at n=57A218796
• Expansion of 1/( Product_{k=0..2} (1 - (3*k+1) * x) )^(1/3).at n=6A383627