41790
domain: N
Appears in sequences
- Decimal part of a(n)^(1/5) starts with a 'nine digits' anagram.at n=21A034280
- a(n) = (2*n - 1)*(11*n^2 - 11*n + 6)/6.at n=22A063492
- Smallest positive number of "triangular" shuffles of n(n+1)/2 cards needed to restore them to their original order.at n=20A122158
- Numbers k such that 2*k-1, 4*k-1, 6*k-1 and 8*k-1 are primes.at n=24A124487
- Numbers k such that 2*k-1, 4*k-1, 6*k-1, 8*k-1 and 10*k-1 are primes.at n=5A124488
- Number of base 22 n-digit numbers with adjacent digits differing by three or less.at n=5A126490
- Sequence obtained from Fibonacci numbers by taking the factorials of each digit and summing.at n=24A164955
- Number T(n,k) of equivalence classes of ways of placing k 9 X 9 tiles in an n X n square under all symmetry operations of the square; irregular triangle T(n,k), n>=9, 0<=k<=floor(n/9)^2, read by rows.at n=56A236936
- Numbers k such that 2*10^k - 87 is prime.at n=27A273907
- a(n) = floor(sinh(n) / n^2).at n=16A274489