19310

Appears in sequences

• Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below.at n=24A078612
• a(1)=1. a(n) = a(n-1) + sum of the triangular numbers which are among the first (n-1) terms of the sequence.at n=35A100963
• Numbers formed by setting bits representing odd primes, where bit_no = (prime - 1)/2. Setting bit number b is the same as OR-ing with 2^b (i.e., bit numbers start at zero).at n=8A133155
• Partial sums of A053872.at n=13A155974
• First of 3 or more consecutive integers with equal values of phi(phi(n)).at n=22A167767
• a(n) = Sum_{i=0..n} digsum_3(i)^4, where digsum_3(i) = A053735(i).at n=60A231505
• Partial sums of the Dedekind psi_2(k) function, for 1 <= k <= n.at n=36A321973