33596

Appears in sequences

• Numbers k such that sopf(k) = sopf(k+2), where sopf(k) = A008472(k).at n=26A063968
• a(0) = 1; for n>0, a(n) = (n+3)*2^(n-2)-n*binomial(n-1, floor( (n-1)/2 ))-(n-1)*binomial(n-2,floor((n-2)/2)).at n=14A121285
• Start with a(1)=1; for n >= 1, a(n+1)=a(n)+a(k) with k=[n-n-th digit of "e"]. If k<0 or k=0, then a(k)=0.at n=39A133392
• a(n) is the smallest number which is the sum of two positive n-gonal numbers in more than one way.at n=20A199809
• Number of nX7 0..1 arrays with every element equal to 1, 2, 4, 6 or 8 king-move adjacent elements, with upper left element zero.at n=10A298887
• Number of nX7 0..1 arrays with every element equal to 0, 1, 2 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=4A302414
• Number of 5Xn 0..1 arrays with every element equal to 0, 1, 2 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=6A302418
• Numbers k such that A003415(k) == A276085(k) (mod 2310), where A003415 is the arithmetic derivative and A276085 is the primorial base log-function.at n=32A391864