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!)
A092504 a(n) = prime(n) + prime(n^2). 2

%I #19 Mar 23 2023 17:34:10

%S 4,10,28,60,108,164,244,330,442,570,692,864,1050,1236,1474,1672,1938,

%T 2204,2504,2812,3156,3540,3886,4300,4734,5152,5622,6114,6590,7110,

%U 7700,8292,8874,9480,10080,10778,11478,12212,12910,13672,14506,15282,16068

%N a(n) = prime(n) + prime(n^2).

%F a(n) = A000040(n) + A011757(n). - _Elmo R. Oliveira_, Mar 22 2023

%e a(1) = 4 because prime(1) = 2 and prime(1) = 2.

%e a(2) = 10 because prime(2) = 3 and prime(4) = 7.

%e a(3) = 28 because prime(3) = 5 and prime(9) = 23.

%t Table[Prime[n] + Prime[n^2], {n, 45}] (* _Robert G. Wilson v_, Apr 08 2004 *)

%Y Cf. A000040, A011757.

%K nonn

%O 1,1

%A _Giovanni Teofilatto_, Apr 05 2004

%E Corrected and extended by _Robert G. Wilson v_, Apr 08 2004

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 April 24 06:34 EDT 2024. Contains 371920 sequences. (Running on oeis4.)