19986

Appears in sequences

• Number of multiplex juggling sequences of length n, base state <1,1,1> and hand capacity 2.at n=6A136779
• a(1)=1; thereafter a(n) is smallest positive number not already in the sequence such that the sum a(1)+...+a(n) divides the concatenation a(1)...a(n).at n=4A151995
• a(n) = 2*(10^n - 7).at n=3A175237
• a(n) = n*(24*n^3 - 60*n^2 + 54*n - 17).at n=6A272379
• Number of n X 4 0..2 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=2A279653
• T(n,k) = Number of n X k 0..2 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=17A279657
• Number of 3Xn 0..2 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=3A279659
• Numbers k such that (58*10^k + 221)/9 is prime.at n=23A291661
• G.f.: Sum_{k>=1} x^(2*k-1)/(1+x^(2*k-1)) * Product_{k>=1} (1+x^k)/(1-x^k).at n=23A305124
• G.f.: Sum_{n>=0} x^n * (1 + x^n)^n / (1 + x^(n+1))^(n+1).at n=58A323557
• Number of integer partitions of n with one fewer distinct multiplicities than distinct parts.at n=45A325244
• a(0) = ... = a(4) = 1; a(n) = Sum_{k=1..n-5} a(k) * a(n-k-5).at n=34A346049
• Numbers with arithmetic derivative which is a palindromic prime number (A002385).at n=34A359332
• Least k such that k*A000668(n)*A000668(n+2) + 1 is prime, where A000668(n) is the n-th Mersenne prime.at n=21A365063