19459

Appears in sequences

• a(n) = floor(10000*log(n)).at n=6A004243
• a(n) = 10000*log(n) rounded to nearest integer.at n=6A004244
• Number of partitions of n into parts not of the form 17k, 17k+4 or 17k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=40A035965
• Numbers k such that 199*2^k-1 is prime.at n=40A050851
• a(0) = 1, a(n) = k*a(n-1) + 1 is a multiple of n-th prime. If no such number exists then a(n) = 0 and a(n+1) = k*a(n-1) + 1 is a multiple of (n+1)-th prime; i.e., a(r) = smallest multiple of the r-th prime = k* a(s) + 1 where a(s) is the last nonzero term.at n=10A069565
• Number of partitions of n with rank 2 (the rank of a partition is the largest part minus the number of parts).at n=54A101199
• Coefficients of the B-Rogers mod 14 identity.at n=42A105781
• Expansion of 1/(x^k*(1-x-3*x^(k+1))) for k=4.at n=21A143455
• Numbers n such that a positive number m <= n exists such that n-m, n+m, and n*m are triangular numbers.at n=8A224935
• Number of conjugacy classes for a non-abelian group of order p^3, where p is prime: a(n) = p^2 + p - 1 where p = prime(n).at n=33A319597
• Number of multiset partitions of uniform integer partitions of n in which all parts have the same length.at n=42A320451
• G.f. A(x) satisfies: A(x) = (1-x) * Sum_{n>=0} x^n / (1 - x*A(x)^n).at n=11A340361
• Consecutive states of the linear congruential pseudo-random number generator for Smalltalk-80 when started at 1.at n=6A384220