40080

Appears in sequences

• Numbers n such that prime(n) mod n <= 10.at n=54A022465
• Numbers k such that prime(k) == 7 (mod k).at n=10A023149
• Partition numbers rounded to nearest integer given by the Hardy-Ramanujan approximate formula.at n=39A050811
• Number of solutions to x*frac[p(x)/x]<=Log[n] or A004648(n)<=Log[n].at n=29A099641
• Determinants of 4 X 4 matrices of 16 consecutive primes.at n=38A118799
• Number of distinct Markov type classes of order 4 possible in binary strings of length n.at n=14A132299
• Numbers k such that k and k^2 use only the digits 0, 1, 4, 6 and 8.at n=50A136861
• Consider the base-9 Kaprekar map n->K(n) defined in A165110. Sequence gives numbers belonging to cycles, including fixed points.at n=12A165115
• Consider the base-9 Kaprekar map n->K(n) defined in A165110. Sequence gives numbers belonging to cycles of length greater than 1.at n=11A165117
• Number of permutations of {1,...,n} avoiding adjacent step pattern up, up, down, down, down, down.at n=8A177548
• Number of strings of numbers x(i=1..n) in 0..6 with sum i^3*x(i)^2 equal to n^3*36.at n=10A184300
• Numbers n such that either prime(n-1) == -1 (mod n) or prime(n+1) == -1 (mod n) but not both.at n=31A225318
• Smallest number k such that prime(n) divides the n-th divisor of k.at n=37A226101
• Number of n X 2 0..2 arrays with horizontal differences mod 3 never 1, vertical differences mod 3 never -1, rows lexicographically nondecreasing, and columns lexicographically nonincreasing.at n=28A229422
• Number of ways to select 2 disjoint point triples from an n X n X n triangular point grid, each point triple forming an 2 X 2 X 2 triangle.at n=16A289223
• Expansion of e.g.f. Product_{k>=1} (1 + log(1 + x)^k)/(1 - log(1 + x)^k).at n=7A307523
• Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=6A317599
• Number of n X 7 0..1 arrays with every element unequal to 0, 1, 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=2A317603
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=38A317604
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 1, 2, 3, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=42A317604