|
%I #33 Mar 16 2021 04:55:40
%S 3,15,165,2805,86955,3565155,210344145,14093057715,1169723790345,
%T 127499893147605,16192486429745835,2542220369470096095,
%U 455057446135147201005,86915972211813115391955,18339270136692567347702505,4419764102942908730796303705
%N Piptorial numbers = product of first n pips or prime-indexed primes.
%C The numbers after the first always end in 5. This is obvious since all pips are odd and their product (excluding 5) = 2k+1 and 5*(2k+1) = 10k+5. Sum of reciprocals converges to 0.4064288978193657814428353009..
%H Harvey P. Dale, <a href="/A080696/b080696.txt">Table of n, a(n) for n = 1..278</a>
%F a(n) = Product_{k=1..n} prime(prime(k)). - _Michel Marcus_, Mar 15 2021
%e prime(prime(1)), prime(prime(1))*prime(prime(2)), ...
%e pip(1) = 3, pip(2) = 5, pip(3) = 11; piptorial(3) = 3*5*11 = 165.
%t nn=50;FoldList[Times,1,Transpose[Select[Thread[{Prime[Range[nn]], Range[nn]}], PrimeQ[ Last[#]]&]][[1]]] (* _Harvey P. Dale_, Jul 05 2011 *)
%t FoldList[Times,Table[Prime[Prime[n]],{n,20}]] (* _Harvey P. Dale_, May 06 2018 *)
%o (PARI) piptorial(n) = {sr=0; pr=1; for(x=1,n, y=prime(prime(x)); pr*=y; print1(pr" "); sr+=1.0/pr; ); print(); print(sr) }
%o (PARI) a(n) = prod(k=1, n, prime(prime(k))); \\ _Michel Marcus_, Mar 15 2021
%o (Python)
%o from sympy import prime, nextprime
%o def aupton(terms):
%o prod, p, alst = 1, 2, []
%o while len(alst) < terms:
%o p, prod = nextprime(p), prod * prime(p)
%o alst.append(prod)
%o return alst
%o print(aupton(16)) # _Michael S. Branicky_, Mar 15 2021
%Y Cf. A006450.
%K easy,nonn
%O 1,1
%A _Cino Hilliard_, Mar 04 2003
%E Name clarified by _Michel Marcus_, Aug 04 2015
%E More terms from _Harvey P. Dale_, May 06 2018
| 