162288

Appears in sequences

• a(n) = (n-4)^(n-3) - (n-3)^(n-4) + 1.at n=6A111454
• Numbers with prime factorization pq^2r^2s^4.at n=28A190319
• Number n such that Fibonacci(n) is divisible by n, n + 1 and n - 1.at n=23A221018
• Number of nX3 0..2 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 3 and at least one element with value (x(i,j)-1) mod 3, and upper left element zero.at n=5A231026
• Number of nX6 0..2 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 3 and at least one element with value (x(i,j)-1) mod 3, and upper left element zero.at n=2A231029
• T(n,k)=Number of nXk 0..2 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 3 and at least one element with value (x(i,j)-1) mod 3, and upper left element zero.at n=30A231031
• T(n,k)=Number of nXk 0..2 arrays x(i,j) with each element horizontally, vertically or antidiagonally next to at least one element with value (x(i,j)+1) mod 3 and at least one element with value (x(i,j)-1) mod 3, and upper left element zero.at n=33A231031
• Expansion of Product_{k>=1} 1/(1-x^k)^(k*(k-1)/2).at n=20A258349
• a(n) = Sum_{k=0..n} 2^(n-k) * binomial(n+4,k+4) * binomial(2*k+8,k+8).at n=5A387274
• Exponential abundant numbers that are not exponential unitary abundant.at n=24A391085
• Exponential Zumkeller numbers that are not exponential unitary Zumkeller numbers.at n=27A391090