32653

Properties

Appears in sequences

• Fractional part of e^a(n) is the largest yet.at n=10A091560
• Let p = n-th irregular prime, A000928(n). Then a(n) = smallest value of m such that numerator(Bernoulli(2*m)/(2*m)) / numerator(Bernoulli(2*m)/(2*m*(2*m-1))) equals p.at n=17A092291
• prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 9.at n=27A109563
• Primes p such that q-p = 34, where q is the next prime after p.at n=10A134116
• Numbers k such that the fractional part of e^k is greater than 1-(1/k).at n=6A153704
• Primes of the form 5*x^2 - 2*y^2, where x and y are successive natural numbers.at n=16A177077
• Number of partitions p of n such that (maximal multiplicity of the parts of p) < (number of distinct parts of p).at n=44A240305
• Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 1 3 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 1 3 6 or 7.at n=7A252151
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 1 3 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 1 3 6 or 7.at n=37A252157
• Primes p such that prime(p)^2 - 2 = prime(q) for some prime q.at n=31A261354
• Primes of the form k*(k+2)/3 - 3, k>2.at n=35A262203
• Number of (undirected) cycles on the n X 2 king graph.at n=10A339196
• a(n) = n*A340339(n)+b, where b = 1 if n is even or 2 if n is odd.at n=35A340340
• Number of factorizations of the n-th Fibonacci number.at n=47A346491
• Primes p such that neither g-1 nor g+1 is prime, where g is the gap from p to the next prime.at n=28A355485
• Consecutive states of the linear congruential pseudo-random number generator (10924*s+11830) mod (2^15+1) when started at s=1.at n=36A384150
• Prime numbersat n=3505