25100

Appears in sequences

• 4th power of rooted tree enumerator: linear forests of 4 rooted trees.at n=9A000300
• a(n) is the concatenation of n and 4n.at n=24A019552
• Positive numbers k such that k and 2*k are anagrams in base 9 (written in base 9).at n=34A023079
• Structured tetrakis hexahedral numbers (vertex structure 5).at n=19A100174
• a(n) = Sum_{k=0..floor(n/2)} binomial(2n-2k,2k)10^(n-k).at n=4A108487
• Number of free hexagonal polygons of symmetry class D_(2h) and area n.at n=32A121211
• Triangle T(n,m), [x*A(x)]^m=sum(n>=m T(n,m)*x^n), where A(x) satisfies x*A(x)^2= -(2*x*A(x)+sqrt(1-4*x*A(x))-1)/(4*x*A(x)+sqrt(1-4*x*A(x))-1).at n=40A188109
• Constant term of the reduction by x^2->x+1 of the polynomial p(n,x) defined at Comments.at n=14A193006
• Number of (n+1) X (n+1) -10..10 symmetric matrices with every 2 X 2 subblock having sum zero and two distinct values.at n=15A211813
• Expansion of Product_{k>=1} ((1+x^k)/(1-x^k))^(2*k).at n=9A261386
• Number T(n,k) of partitions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the partition; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=32A261719
• Number of partitions of n where each part i is marked with a word of length i over a quaternary alphabet whose letters appear in alphabetical order and all four letters occur at least once in the partition.at n=3A293368
• G.f. A(x) satisfies: A(x) = x*exp(Sum_{n>=1} Sum_{k>=1} n^k*a(n)^k*x^(n*k)/k).at n=8A307724
• Number of vertices in a "frame" of size n X n (see Comments in A331776 for definition).at n=13A332598
• Numbers that can be written as the product of two divisors greater than 1 such that the number is contained in the string concatenation of the divisors.at n=33A355790
• Consecutive states of the linear congruential pseudo-random number generator (3613*s + 45289) mod 214326 when started at s=1.at n=31A385363