25501

Appears in sequences

• Twice partitioned numbers: the number of ways a number can be partitioned into not necessarily different parts and each part is again so partitioned.at n=15A063834
• Number of base 25 circular n-digit numbers with adjacent digits differing by 1 or less.at n=8A124718
• Binomial transform of [1, 100, 100, 100, ...].at n=8A139701
• Zero followed by partial sums of A008865.at n=42A145067
• Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1000-1001-1111 pattern in any orientation.at n=11A147132
• Numbers k such that sigma(k+1) divides sigma(k-1).at n=32A227304
• Number of (n+2) X (4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00010011.at n=7A260763
• E.g.f.: Limit_{N->oo} [ Sum_{n>=0} (N + n)^(2*n) * (x/N)^n/n! ]^(1/N).at n=5A266481
• Coefficients in the expansion of ([s] + [2s]x + [3s]x^2 + ...)/([r] + [2r]x + [3r]x^2 + ...); [ ] = floor, r = sqrt(3), s = sqrt(2).at n=39A279629
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of e.g.f.: exp(Product_{j=1..n} 1/(1-x^j) - 1).at n=51A294212
• E.g.f.: exp(1/((1-x)*(1-x^2)*(1-x^3)) - 1).at n=6A294214
• G.f.: Sum_{k>=1} x^(2*k-1)/(1+x^(2*k-1)) * Product_{k>=1} 1/(1-x^k).at n=35A305123
• Maximum number of fundamentally different graceful labelings for a simple graph of n nodes.at n=8A379395