299520

Appears in sequences

• Sums of 4 distinct powers of 8.at n=34A038486
• Analog of A095236 when the phones are arranged in a circle.at n=12A095239
• Lower triangular array called S2hat(-4) related to partition number array A144284.at n=30A144285
• Third column (m=3) of triangle S2hat(-4) = A144285.at n=5A144340
• a(n) = sigma(2*a(n-1)) for n>1 with a(1)=1.at n=8A180707
• Number of (w,x,y,z) with all terms in {1,...,n} and w<=2x and y<=3z.at n=26A212513
• E.g.f. equals the series reversion of x - x^2*exp(2*x).at n=5A214688
• Number of (n+1) X (1+1) 0..2 arrays with no element greater than all horizontal neighbors or equal to all vertical neighbors.at n=11A239171
• Coefficients in q-expansion of (E_2^3*E_4 - 3*E_2^2*E_6 + 3*E_2*E_4^2 - E_4*E_6)/3456, where E_2, E_4, E_6 are the Eisenstein series shown in A006352, A004009, A013973, respectively.at n=8A282213
• G.f. A(x) satisfies A(x) = 1 + x^4*A(x)^4*(1 + x*A(x)).at n=28A365730
• a(n) = Sum_{k=0..floor(n/3)} 2^(n-2*k) * binomial(k,n-3*k)^2.at n=23A387485
• a(0) = 0, a(1) = 1; otherwise, a(n) = a(n-1) + a(m), where m is the greatest square < n.at n=48A392473