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.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069102 a(1) = 1; a(2) = 1; a(n) = Prime[n-1] + Prime[n-2] if n > 2. 2

%I #8 Feb 01 2024 19:53:00

%S 1,1,5,8,12,18,24,30,36,42,52,60,68,78,84,90,100,112,120,128,138,144,

%T 152,162,172,186,198,204,210,216,222,240,258,268,276,288,300,308,320,

%U 330,340,352,360,372,384,390,396,410,434,450,456,462,472,480,492,508

%N a(1) = 1; a(2) = 1; a(n) = Prime[n-1] + Prime[n-2] if n > 2.

%H Harvey P. Dale, <a href="/A069102/b069102.txt">Table of n, a(n) for n = 1..1000</a>

%e a(3) = Prime[2] + Prime[1] = 3 + 2 = 5.

%t Join[{1,1},Total/@Partition[Prime[Range[60]],2,1]] (* _Harvey P. Dale_, Feb 01 2024 *)

%o (PARI) print1("1,1,"):for(n=1,100,print1(prime(n)+prime(n+1)","))

%Y Cf. A001043, A011974.

%K nonn

%O 1,3

%A _Joseph L. Pe_, Apr 06 2002

%E More terms from _Ralf Stephan_, Mar 20 2003

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 20 14:08 EDT 2024. Contains 372717 sequences. (Running on oeis4.)