22332

Appears in sequences

• a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-3)*a(3) for n >= 4, with initial terms 0, 2, 1, 0.at n=19A025253
• Numbers using only digits 2 and 3.at n=36A032810
• Numbers n with property that every digit is a prime factor of n.at n=26A062239
• Multiples of 6 with only prime digits (2, 3, 5 and 7).at n=29A077535
• Numbers k such that the "inventory" A063850 of k is a palindrome.at n=17A079466
• Triangle read by rows: T(n,k) (0<=k<=n) is the number of Delannoy paths of length n, having k (1,1)-steps on the line y=x (a Delannoy path of length n is a path from (0,0) to (n,n), consisting of steps (E=1,0), N=(0,1) and D(1,1)).at n=28A109979
• Number of Delannoy paths of length n with no (1,1)-steps on the line y=x.at n=7A109980
• Column 2 of triangle A128562.at n=16A128563
• Eigentriangle, row sums = A001850, the Delannoy numbers.at n=28A152250
• Eigentriangle, row sums = A001850, the Delannoy numbers.at n=37A152250
• Sums of 2 successive primes s = prime(m) + prime(m+1) such that all digits of s are primes.at n=15A173719
• G.f.: ((1+2*x)*sqrt(1-6*x^2+x^4)-1+5*x^2-2*x^3)/(2*x*(1-6*x^2)).at n=14A212205
• List of primitive words over the alphabet {2,3}.at n=27A213971
• Number of partitions of n that have even-sized Ferrers matrix.at n=40A238945
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 249", based on the 5-celled von Neumann neighborhood.at n=30A271014
• Kuba-Panholzer Table 2 pattern 123, 321 for Stirling permutation k = 2.at n=5A308679
• Largest cost for a permutation problem.at n=40A367185