19492
domain: N
Appears in sequences
- Number of partitions satisfying cn(0,5) < cn(1,5) + cn(2,5) + cn(3,5) and cn(0,5) < cn(4,5) + cn(2,5) + cn(3,5).at n=36A039847
- a(n) = k such that the k-th triangular number is A068808(n).at n=25A067991
- Numbers k such that 10^k - 117 is prime.at n=23A108654
- Expansion of e.g.f.: A(x) = exp( Sum_{n>=1} (n-1)!*x^n/n ).at n=6A159476
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 0,0,1,1,1,1,1 for x=0,1,2,3,4,5,6.at n=5A205081
- Least k such that k^3 + q is divisible by 3^n where q is the n-th number congruent to 1 or -1 (mod 18).at n=9A251731
- Those terms of A255571 whose every A080541/A080542-rotation is also a term of A255571.at n=33A258001
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 278", based on the 5-celled von Neumann neighborhood.at n=7A271096
- a(n) = A273059(4n+2).at n=24A275918
- Numbers that are the sum of eight fourth powers in eight or more ways.at n=30A345583
- Numbers that are the sum of eight fourth powers in nine or more ways.at n=10A345584
- Numbers that are the sum of eight fourth powers in ten or more ways.at n=2A345585
- Numbers that are the sum of eight fourth powers in exactly ten ways.at n=2A345842
- G.f. satisfies A(x) = A(x^2) + A(x^2)^2*A(x^3)/A(x^6), with A(0) = 0 and A'(0) = 1.at n=40A382316