18851

Appears in sequences

• Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n + 5^n + 4^n.at n=10A057266
• Floor (e^(n / log(n))).at n=33A096181
• a(n) = Fibonacci(n-1)*a(n-1) - a(n-2), with a(1)=0, a(2)=1.at n=8A121879
• a(n) = n^4 - n^3 - n^2 - n - 1.at n=12A125082
• Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 0100-1111-0010 pattern in any orientation.at n=16A146369
• Positive numbers y such that y^2 is of the form x^2+(x+2401)^2 with integer x.at n=15A157247
• a(n) = 2*a(n-1) + 7*a(n-2) for n > 1; a(0) = 1, a(1) = 7.at n=7A164544
• The 4k+3 integers corresponding to the record positions in A165601.at n=38A166046
• Positive integers of the form (10*m^2+1)/11.at n=26A179338
• G.f.: Sum_{n>=0} x^n * Product_{k=1..n} (1 + k*x + x^2).at n=11A202476
• Number of partitions p of n including floor(mean(p)) as a part.at n=39A241334
• Triangular array: row n gives the coefficients of the polynomial p(n,x) defined in Comments.at n=37A247376
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 3", based on the 5-celled von Neumann neighborhood.at n=30A269912
• Number of generalizations of the partition 1^n with all elements taken modulo 2.at n=17A276033
• p-INVERT of the positive integers (A000027), where p(S) = 1 - S - S^2.at n=8A289780
• Expansion of Sum_{k>=0} x^(k^2) / Product_{j=1..k} (1 + j*x^j).at n=35A306707
• Number of colored integer partitions of n such that seven colors are used and parts differ by size or by color.at n=8A327385
• Number of n-step self-avoiding walks on the half-Manhattan square lattice.at n=12A336724
• Numbers that are the sum of six fourth powers in four or more ways.at n=35A345561
• Numbers that are the sum of six fourth powers in exactly four ways.at n=33A345816