36991

Appears in sequences

• Strong pseudoprimes to base 25.at n=24A020251
• Reverse of smallest prime factor of k = largest prime factor of k+1; a(1)=1.at n=31A071392
• Numbers k such that 5*10^k - 3 is prime.at n=18A103003
• a(n) = 32*n^2 - 1.at n=33A158563
• A triangle sequence derived from setting an Euler numbers A122045 generalization equal to the Eulerian numbers A008292 to get a generating function expansion: p(x,t) = ((-1 + exp(x)) (-1 + x)/(-1 + exp(t*x) + t - exp(t)* x)).at n=44A178232
• a(n) = n^3 - 2*n^2 - 1.at n=33A214731
• Number of 5Xn 0..1 arrays with every element equal to 0, 1, 3 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=8A302430
• Sum of the fifth largest parts of the partitions of n into 9 parts.at n=47A326469
• Reversal of base-n digits of largest prime < n^3.at n=32A329931
• a(1) = 0 and a(n+1) > a(n) is the smallest integer such that a(n+1)^2-a(n)^2 is triangular.at n=19A358416