28628

Appears in sequences

• a(n) = ((n+1)-st Fibonacci number) - (n-th non-Fibonacci number).at n=21A014241
• Partial sums of the partition numbers A000041 of the positive integers.at n=29A026905
• Let p(k) be the number of partitions of k (A000041); a(n) = Sum_{1<=k<=n, gcd(k,n)=1} p(k).at n=30A096223
• Expansion of x*(1+2*x+8*x^2+4*x^3+3*x^4) / ( (1+x)^2*(x-1)^4 ).at n=33A178947
• T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=22A186484
• T(n,k)=Number of (n+1)X(k+1) 0..4 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=26A186484
• T(n,m)=Number of (n+1)X3 0..m arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=41A190023
• Number of simple labeled graphs on n nodes that contain some size k connected component, all of whose nodes are labeled with integers {1,2,...,k} for some k in {1,2,...,n}.at n=5A237195
• a(n) is the number of different ways of concatenating the numbers {3^k, k=0,...,n} so as to produce a prime number.at n=7A246718
• Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 or 00000101.at n=21A259768
• Bitwise XOR of trajectories of rule 30 and rule 124, when both are started from a lone 1 cell: a(n) = A110240(n) XOR A267357(n).at n=7A328103
• Number of integer partitions of n having a unique part of least multiplicity.at n=50A362610