25509

Appears in sequences

• Numbers n such that n is a substring of its square in base 5 (written in base 10).at n=18A018829
• Number of partitions of n into parts not of the form 25k, 25k+11 or 25k-11. Also number of partitions with at most 10 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=38A036010
• a(n) = n * prime(prime(n)).at n=32A080697
• a(n) = (n+1)*(n+2)*(n+3)*(19*n^3 + 111*n^2 + 200*n + 120)/720.at n=8A108684
• G.f. A(x) equals the limit of the composition of functions (x+x^n) in reverse order; let F_1(x) = x, F_{n+1}(x) = F_n(x) + F_n(x)^(n+1), then A(x) = limit F_n(x): A(x) = ...o x+x^n o ... o x+x^3 o x+x^2 o x.at n=12A119471
• Rectangular table where column k equals row sums of matrix power A078121^k, read by antidiagonals.at n=49A125790
• Column 4 of table A125790; also equals row sums of matrix power A078121^4.at n=5A125794
• A diagonal of table A125790: a(n) = A125790(n+1,n).at n=4A125798
• Reversion of x-x^2-x^3-2*x^4.at n=8A191242
• Number of n X 2 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 2,0,3,4,1 for x=0,1,2,3,4.at n=20A196204
• G.f. A(x) satisfies A(x) = 1+x^2/(1-x)*A(x^2/(1-x)).at n=24A201196
• Number of partitions of 2^n into powers of 2 less than or equal to 32.at n=7A210774
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 633", based on the 5-celled von Neumann neighborhood.at n=27A273301