The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A228698 a(n) = 8*Product{i=1..n} p(i) - 1, where p(i) = i-th odd prime. 2

%I #11 Apr 02 2015 18:15:53

%S 7,23,119,839,9239,120119,2042039,38798759,892371479,25878772919,

%T 802241960519,29682952539239,1217001054108839,52331045326680119,

%U 2459559130353965639,130356633908760178919,7691041400616850556279,469153525437627883933079,31433286204321068223516359,2231763320506795843869661559

%N a(n) = 8*Product{i=1..n} p(i) - 1, where p(i) = i-th odd prime.

%H Alois P. Heinz, <a href="/A228698/b228698.txt">Table of n, a(n) for n = 0..150</a>

%H A. J. Hanson, G. Ortiz, A. Sabry and Y.-T. Tai, <a href="http://arxiv.org/abs/1305.3292">Discrete Quantum Theories</a>, arXiv preprint arXiv:1305.3292, 2013 [See footnote 25]

%p a:= n-> 8*mul(ithprime(i+1), i=1..n)-1:

%p seq(a(n), n=0..20); # _Alois P. Heinz_, Sep 16 2013

%t 8*FoldList[Times,1,Prime[Range[2,30]]]-1 (* _Harvey P. Dale_, Mar 19 2015 *)

%Y Cf. A228699.

%K nonn

%O 0,1

%A _N. J. A. Sloane_, Sep 03 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 18 03:12 EDT 2024. Contains 372617 sequences. (Running on oeis4.)