26212
domain: N
Appears in sequences
- Every suffix prime and no 0 digits in base 9 (written in base 9).at n=48A024784
- Numbers n such that there are exactly 4 primes p such that floor(n*log(n))+1<=p<=floor((n+1)*log(n+1))-1.at n=4A068362
- Starting positions of strings of three 6's in the decimal expansion of Pi.at n=20A083625
- a(n) = 4 * floor(24*2^n/15) = 4*A077854(n).at n=12A102652
- Triangle, read by rows, where T(n,k) = n*T(n-1,k-1) + T(n-1,k-2) for n>0 and k>1, with T(n,0) = T(n-1,n-1) and T(n,1) = n*T(n-1,0) for n>0 and T(0,0) = 1.at n=40A132005
- a(n) = Sum_{k=0..n} (-1)^k * binomial(n+2*k+5,n-k) * Fibonacci(k+1).at n=10A390858