39869

Properties

Appears in sequences

• Bertrand primes: a(n) is largest prime < 2*a(n-1) for n > 1, with a(1) = 2.at n=16A006992
• Pisot sequence L(7,8).at n=25A048588
• Pisot sequence L(8,10).at n=24A048591
• Smallest prime p such that n applications of f lead form p to 2, where f is the mapping of primes > 2 to primes defined by A052248.at n=16A080190
• Primes with digit sum = 35.at n=15A106770
• a(1) = 1. If a(n) is composite, a(n+1) = 2*a(n)+1; otherwise, a(n+1) = 2*a(n).at n=15A125050
• Expansion of x/((1 - x - x^4)*(1 - x)^6).at n=14A145135
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (-1, 1, 1), (0, 0, -1), (1, 0, 0)}.at n=10A148702
• a(n) = largest prime <= 2a(n-1), with a(0)=1.at n=17A185231
• Numbers n such that the n-th digit (after the decimal point) in the decimal expansion of Pi are the occurrence of the least significant digit represented by the more significant digits.at n=30A201545
• a(n) = prime(n*prime(n)).at n=31A228529
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 573", based on the 5-celled von Neumann neighborhood.at n=32A272997
• Number of perfect-power divisors of n!.at n=38A336416
• Number of graph minors in the n-book graph.at n=7A354670
• Prime numbersat n=4192