25090

Appears in sequences

• Coordination sequence for MgNi2, Position Ni3.at n=39A009934
• a(0) = 1, a(n) = 32*n^2 + 2 for n > 0.at n=28A010021
• Numbers whose base-5 representation contains exactly three 0's and three 3's.at n=22A045202
• Numbers k such that (phi(k-2) + phi(k+2))/2 = phi(k); 2-phi/balanced numbers.at n=25A099633
• Number of partitions of n having no more odd than even parts.at n=44A171966
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 6, n >= 2.at n=42A213070
• a(n) = number of terms in A213717 whose magnitude is in range [(2^n)-1,(2^(n+1))-2] (or equally, in range [(2^n),(2^(n+1))-1]).at n=16A213722
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths ending at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 7, n >= 2.at n=35A214373
• Number of partitions of n into 8 parts such that every i-th smallest part (counted with multiplicity) is different from i.at n=27A244244
• a(n) = n! * [x^n] exp(x)/(1 - log(1+x)).at n=9A291981
• Positions of 0's in A330314.at n=32A330325
• Numbers k such that A124440(k) is a square.at n=9A341032
• G.f. A(x) satisfies x = Sum_{n>=1} ((1 + A(x)^n)^n - 1).at n=8A378579