24964497408
domain: N
Appears in sequences
- Number of n X 2 0..2 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once.at n=14A268965
- a(n) is the smallest number m such that tau(m) = n*tau(m-1) = n*tau(m+1) or 0 if no such m exists, where tau(k) = A000005(k).at n=28A350936
- a(1)= 2. For n > 1, a(n) is the least number k such that k, k - a(n-1) and k + a(n-1) all have n prime divisors counted by multiplicity.at n=29A365852