36981

Appears in sequences

• Number of steps to compute n-th prime in PRIMEGAME (slow version).at n=9A007547
• Numerators of continued fraction convergents to sqrt(110).at n=5A041198
• Numerators of continued fraction convergents to sqrt(440).at n=5A041838
• Number of primes between successive Fibonacci numbers exclusive.at n=29A052011
• Number of primes between successive Fibonacci numbers inclusive.at n=30A076777
• Number of primes between successive Fibonacci numbers (including possibly the Fibonacci numbers themselves).at n=29A082602
• Number of primes p such that Fib(n+1) <= p < Fib(n+2), (where Fib = A000045).at n=28A095354
• a(n) = ChebyshevT(3, n).at n=21A144129
• a(n) = (n+3)^2*n/2 + 1.at n=40A154560
• a(n) = 22*n^2 - 1.at n=40A158540
• a(n) + a(n+2) = n^3.at n=42A206481
• a(n) = n^3 - a(n-2) for n >= 2 and a(0)=0, a(1)=1.at n=41A215097
• Number of nX5 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1, 2 or 4 neighboring 1s.at n=3A297717
• T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1, 2 or 4 neighboring 1s.at n=31A297720
• Number of 4Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1, 2 or 4 neighboring 1s.at n=4A297723
• Partial sums of A092182.at n=5A302561
• a(n) = 32*n^3 + 48*n^2 + 18*n + 1.at n=10A322830
• a(n) is the number of edges formed by n-secting the angles of a nonagon (enneagon).at n=33A335783
• Odd numbers that can be written as phi(k) + d(k) for more than one k, where phi(k) = A000010(k) is Euler's totient function and d(k) = A000005(k) is the number of divisors of k.at n=2A357918