41604

Appears in sequences

• a(n) is the number of numbers between 1 and 2^m with m-n prime factors (counted with multiplicity), for m sufficiently large.at n=13A052130
• Numbers k such that k*2^(k/2) + 1 is prime.at n=11A058767
• Numbers k such that k * (1+i)^k - 1 is a Gaussian prime.at n=29A058771
• a(1)=1, a(n)=a(n-1)+n^0 if n odd, a(n)=a(n-1)+ n^5 if n is even.at n=7A140143
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, -1), (1, -1, 0), (1, 1, -1), (1, 1, 0)}.at n=10A148638
• a(n) = 144*n^2 - 12.at n=16A158543
• Number of n X 2 0..5 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=19A201136
• Number of (n+1) X 4 0..2 matrices with each 2 X 2 subblock idempotent.at n=15A224671
• Numbers k such that 7*10^k - 89 is prime.at n=23A281828