28687

Properties

Appears in sequences

• Primes that remain prime through 4 iterations of function f(x) = 4x + 9.at n=10A023312
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 96 ones.at n=30A031864
• Number of pure 2-complexes on 7 unlabeled nodes with n multiple 2-simplexes.at n=8A050912
• Grundy function for turn-at-most-7-coins game.at n=27A054044
• (5^n)-th prime.at n=5A055680
• Prime numbers at large subscripts: a(n) = prime(n^n).at n=5A062448
• Engel expansion of sqrt(3/2).at n=9A068388
• Positions of check bits in code in A075940.at n=12A075942
• a(n) = prime(5^prime(n)).at n=2A096326
• Primes for which the weight as defined in A117078 is 11 and the gap as defined in A001223 is 10.at n=29A119596
• Numbers k such that (18^k - 5^k)/13 is prime.at n=9A128353
• 3n^3 + 2n^2 + n + 1.at n=21A130884
• Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1001-1111-1000 pattern in any orientation.at n=11A146840
• Beginnings of maximal chains of primes with four members (three links).at n=12A152867
• Primes p of the form : p+p^2+p^3-+8=prime.at n=26A154823
• Primes p such that 8*p^2-2*p-1 divides Fibonacci(p).at n=24A159231
• Numbers n such that prime(n) + reversal(prime(n)) is a square.at n=19A227371
• Primes of the form (3^k mod k^3) + 1, in order of increasing k.at n=15A233906
• Number of unlabeled rooted trees with n nodes and maximal outdegree (branching factor) 6.at n=10A244402
• a(n) = prime(A003593(n)).at n=24A334276