29460

Appears in sequences

• a(1) = 3; a(n+1) = a(n)-th composite.at n=41A022451
• a(n) = dot_product(1,2,...,n)*(3,4,...,n,1,2).at n=42A026037
• Minimal peaks in digital expansions of Pi: positions of peaks equal to 1.at n=31A105275
• a(n) = A000203(n) * A024916(n).at n=23A143238
• G.f. satisfies: A(x) = Product_{n>=1} (1 + x^n) * (1 + x^(2n)*A(x)).at n=16A190822
• Least positive integer k such that both k and k*n belong to the set {m>0: 2*prime(prime(m))+1 = prime(p) for some prime p}.at n=22A261362
• Viggo Brun's ternary continued fraction algorithm applied to { log 2, log 3/2, log 5/4 } produces a list of triples (p,q,r); sequence gives p values.at n=26A359742