20006

Appears in sequences

• Number of partitions of n in which no parts are multiples of 5.at n=41A035959
• Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives k values.at n=19A054236
• Multiples of 7 in which there is no common digit in successive terms.at n=24A083495
• Numbers n such that there are (presumably) nine palindromes in the Reverse and Add! trajectory of n.at n=8A090070
• List the positions of all digits '1' in the sequence. This is the lexicographically earliest increasing sequence with this property.at n=44A098645
• Binomial transform of A101910, where A101910(n) = a(A000120(n-1)) for n>0 with A101910(0) = 1.at n=12A101911
• Numbers k such that k and k^2 use only the digits 0, 2, 3, 4 and 6.at n=17A136883
• Number of n X 3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,4,0,2,1 for x=0,1,2,3,4.at n=8A196648
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 3,4,0,2,1 for x=0,1,2,3,4.at n=57A196653
• G.f. satisfies: A(x) = exp( Sum_{n>=1} A(x)^n / A(x^n) * x^n/n ).at n=13A198520
• Triangle read by rows: number of permutations of [1..n] with k progressions of rise 2, distance 1 and length 3 (n >= 0, k >= 0).at n=20A216716
• Numbers k where k^2 is an anagram of (k+2)^2.at n=10A261749
• Coefficients in the expansion of Product_{m>=1} (1 - q^(13*m))/(1 - q^m).at n=37A341714