32129
domain: N
Appears in sequences
- Generalized Fibonacci numbers: a(n) = a(n-1) + 8*a(n-2).at n=9A015443
- Numbers n such that the sum of the prime factors of n equals the product of the digits of n.at n=34A067173
- Frobenius number of the numerical semigroup generated by 3 consecutive triangular numbers.at n=32A069755
- Numbers k such that the concatenation of k with 4*k gives a square.at n=2A115535
- a(n) = 7^n mod 2^n.at n=16A138616
- a(n) = n^5 - n^3 - 2*n^2 + 1.at n=8A177075
- Numbers k such that k^p-p is prime, where p is product of the digits of k.at n=25A178328
- Number of nX3 arrays of occupancy after each element moves to some king-move neighbor, without move-in move-out straight through or left turns.at n=3A221747
- Number of nX4 arrays of occupancy after each element moves to some king-move neighbor, without move-in move-out straight through or left turns.at n=2A221748
- T(n,k)=Number of nXk arrays of occupancy after each element moves to some king-move neighbor, without move-in move-out straight through or left turns.at n=17A221749
- T(n,k)=Number of nXk arrays of occupancy after each element moves to some king-move neighbor, without move-in move-out straight through or left turns.at n=18A221749