20365

Appears in sequences

• Number of log-concave compositions (ordered partitions) of n.at n=48A069916
• Numbers k such that (16*10^(k-1) - 61)/9 is a plateau prime.at n=6A082701
• Indices of prime numbers in A014259.at n=11A101761
• Number of ways to design a set of three n-sided dice (using nonnegative integers) such that summing the faces can give any integer from 0 to n^3 - 1.at n=29A131514
• Number of ways to design a set of three n-sided dice (using nonnegative integers) such that summing the faces can give any integer from 0 to n^3 - 1.at n=41A131514
• Numbers k such that A119682(k) is prime.at n=44A136682
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (-1, 0, 1), (1, 0, -1), (1, 1, 1)}.at n=8A149635
• Convolutory inverse of the Thue Morse sequence.at n=30A225132
• Not appropriate for the OEIS.at n=12A248690
• Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 662", based on the 5-celled von Neumann neighborhood.at n=7A273389
• a(n) = A005259(n) mod (n+1)^3.at n=39A289289
• a(n) = Sum_{1 <= x_1 <= x_2 <= x_3 <= x_4 <= x_5 <= n} gcd(x_1, x_2, x_3 , x_4, x_5, n).at n=16A343519
• a(n) = sum of the first n primes whose distance to next prime is 4.at n=42A360226
• Square array read by antidiagonals upwards: T(n,k), n>=0, k>=0, is the number of ways of choosing nonnegative numbers for k indistinguishable A063008(n)-sided dice so that it is possible to roll every number from 0 to (A063008(n))^k-1.at n=48A360440