28665

Appears in sequences

• Coefficient of x^6 in expansion of (1+x+x^2)^n.at n=12A005714
• T(2n-1,n-2), T given by A027907.at n=6A027912
• Row 3 of array in A047666.at n=34A047667
• Triangle, read by rows, of coefficients in powers of e.g.f. for A100076 such that, for each row n>=0, Sum_{k=0..n} T(n,k)/k! = [sqrt(5)^n].at n=34A100075
• Inverse modulo 2 binomial transform of 8^n.at n=5A100741
• Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+16807)^2 = y^2.at n=8A118576
• Numbers k such that k and k^2 use only the digits 1, 2, 5, 6 and 8.at n=30A137005
• The non-repetitive Kaprekar binary numbers in decimal.at n=38A163205
• Partial sums of A162396.at n=23A164120
• a(n) = 65*n^2.at n=20A165798
• Numbers m such that m*reversal(m) contains every decimal digit exactly once.at n=15A178929
• Denominator of the average height of a binary search tree on n elements.at n=14A195583
• G.f. A(x) satisfies A(x)+A(x)^2+A(x)^3 = (1-sqrt(1-4*x))/2.at n=12A212260
• Numbers for which the number of prime divisors counted with multiplicity and the sum of the distinct prime divisors are both perfect.at n=19A233563
• Triangle read by rows: the reversed x = 1+q Narayana triangle at m=3.at n=32A243663
• Numbers n such that A000203(2*n) divides 2*n*A045917(n).at n=20A245629
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 798", based on the 5-celled von Neumann neighborhood.at n=36A273571
• Numbers k such that phi(x) = 12*k+2 is solvable, where phi is Euler's totient A000010.at n=30A289364
• Triangle T(n,r) read by rows: order of the semigroup of orientation-preserving partial transformations of n elements with breath r.at n=32A289710
• a(n) is the factor R(n) having prime factors < (2/3)*n^2 in A285388(n) = R(n)P(n).at n=4A290583