30253

Properties

Appears in sequences

• a(n) = floor(n*phi^20), where phi is the golden ratio, A001622.at n=2A004935
• a(n) = a(n-1) + a(n-2) + 1 for n > 1, a(0)=1, a(1)=5.at n=19A022319
• Primes that remain prime through 3 iterations of function f(x) = 5x + 8.at n=38A023286
• Primes that remain prime through 4 iterations of function f(x) = 9x + 10.at n=17A023327
• Main diagonal of Inverse Stolarsky array.at n=8A035509
• Primes starting and ending with 3.at n=39A062333
• Define an increasing sequence as follows. Given the first term, called the seed (the seed need not have the property of the remaining terms of the sequence), subsequent terms are defined as obtained by inserting/placing digits (at least one) in the previous term to obtain the smallest number with a given property. This is the growing prime sequence for the seed a(1) = 5.at n=4A068170
• Primes p such that p-3 and p+3 are divisible by a cube.at n=28A089201
• Indices of primes in the sequence defined by A(0) = 29, A(n) = 10*A(n-1) - 1 for n > 0.at n=14A101972
• Number of semiprimes <= 2^n.at n=16A125527
• a(n) = A014217(n+3) - A014217(n).at n=19A153263
• Primes p such that both pi(p) and the concatenation of pi(p) and p are prime, where pi is the prime counting function.at n=42A155032
• Number of semiprimes <= 2^prime(n).at n=6A175613
• Total area of the bounding boxes of all integer partitions of n.at n=20A182094
• Primes of the form 6n^2 + 7.at n=29A201601
• Primes of the form 10n^2 + 3.at n=18A201710
• Primes of the form 2n^2 - 5.at n=19A201713
• a(n) = A025179(n-2) + A102839(n-4), for n >= 4, with a(0) = a(2) = 0 and a(1) = a(3) = 1.at n=13A352916
• Prime numbersat n=3271