48692

Appears in sequences

• a(n) = [ a(n-1)/a(1) ] + [ a(n-3)/a(3) ] + [ a(n-5)/a(5) ] + ..., for n >= 3.at n=40A022878
• Spt function: total number of smallest parts (counted with multiplicity) in all partitions of n.at n=32A092269
• spt(7n+5) where spt(n) = A092269(n).at n=4A220502
• Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row and column sum nonprime and every diagonal and antidiagonal sum prime.at n=5A251841
• Number of (n+2)X(6+2) 0..3 arrays with every 3X3 subblock row and column sum nonprime and every diagonal and antidiagonal sum prime.at n=3A251843
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum nonprime and every diagonal and antidiagonal sum prime.at n=39A251845
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum nonprime and every diagonal and antidiagonal sum prime.at n=41A251845
• a(n) = 2*n^3 - 3*n + 1.at n=29A377663
• Expansion of e.g.f. (1 + x)*(1 + x^2/2)*cosh(x).at n=47A388428