30802

Appears in sequences

• Number of series-reduced planted trees with n nodes.at n=21A001678
• Indices of primes where largest gap occurs.at n=15A005669
• Indices of primes where nondecreasing gaps occur.at n=31A085500
• Indices of primes occurring in A031133.at n=22A122412
• a(n) is the index of the smallest prime such that the gap to the next prime is not less than 2*n.at n=43A144309
• a(n) is the index of the smallest prime such that the gap to the next prime is not less than 2*n.at n=44A144309
• a(n) is the index of the smallest prime such that the gap to the next prime is not less than 2*n.at n=45A144309
• Least number x such that there are n numbers of the form 6k-1 or 6k+1 between prime(x) and prime(x+1).at n=31A213903
• Index of the primes of A205827, A000720(A205827(n)).at n=10A214935
• Number of alternating permutations on 2n letters that avoid a certain pattern of length 5 (see Lewis, 2012, Appendix, for precise definition).at n=4A217820
• Indices (i.e., value of A000720 = primepi) of primes in A111870.at n=9A241542
• Number of nX4 nonnegative integer arrays with upper left 0 and lower right n+4-5 and value increasing by 0 or 1 with every step right or down.at n=5A252972
• Number of nX6 nonnegative integer arrays with upper left 0 and lower right n+6-5 and value increasing by 0 or 1 with every step right or down.at n=3A252974
• T(n,k) = Number of n X k nonnegative integer arrays with upper left 0 and lower right n+k-5 and value increasing by 0 or 1 with every step right or down.at n=39A252976
• T(n,k) = Number of n X k nonnegative integer arrays with upper left 0 and lower right n+k-5 and value increasing by 0 or 1 with every step right or down.at n=41A252976
• a(n) is the index k of prime(k), such that abs(prime(k) - Sum_{j=k-2..k+2} prime(j)/5) sets a new record.at n=20A337438
• a(n) is the index k of prime(k), such that abs(prime(k) - Sum_{j=k-1..k+1} prime(j)/3) sets a new record.at n=13A337488
• a(n) is the least k such that the number of integers between (1/4)*prime(k) and (1/4)*prime(k+1) is n.at n=23A390785
• a(n) is the least k such that the number of integers between (1/5)*prime(k) and (1/5)*prime(k+1) is n.at n=18A390786
• a(n) is the least k such that there are exactly n integers between (1/6)*prime(k) and (1/6)*prime(k+1).at n=15A390787