19585

Appears in sequences

• Numbers k such that the continued fraction for sqrt(k) has period 87.at n=10A020426
• Expansion of Product_{m>=1} (1 + m*q^m)^2.at n=14A022630
• a(n)*a(n-9) = a(n-1)*a(n-8)+a(n-4)+a(n-5) with initial terms a(1)=...=a(9)=1.at n=26A133847
• a(n) = 576*n + 1.at n=33A158370
• a(n) = 34*n^2 + 1.at n=24A158586
• A symmetrical triangle based on Narayana numbers and Eulerian numbers of type B: T(n, k) = 2 + A060187(n, k) - 2*binomial(n, k)*binomial(n+1, k)/(k+1).at n=46A176291
• A symmetrical triangle based on Narayana numbers and Eulerian numbers of type B: T(n, k) = 2 + A060187(n, k) - 2*binomial(n, k)*binomial(n+1, k)/(k+1).at n=53A176291
• Number of partitions of n containing at least one part m-10 if m is the largest part.at n=34A212550
• Number of compositions of n with exactly one descent.at n=17A241626
• a(n) = the number of ways in which n is equal to the sum of digits > 0 taken from numbers <= n.at n=16A245438
• Number of length 3 1..(n+2) arrays with no leading partial sum equal to a prime.at n=34A254541
• Numbers n such that the Collatz iterations for n and n + 1 have the same length (A078417) but do not meet a certain condition. (See comments.)at n=30A274410
• a(n) is the smallest positive integer k with k != 10^m (m: nonnegative integer) for which 1/n can be obtained by incorrectly reducing k/(n*k) - by deleting the same digit in the numerator and denominator as often as possible, leaving one digit "1" in the numerator.at n=26A370911
• E.g.f. A(x) satisfies A(x) = 1/(exp(-x*A(x)^3) - x*A(x)).at n=4A379912