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!)
A292926 a(n) = prime(n)*prime(n+1) + prime(n+2). 2

%I #50 Jan 20 2023 09:03:40

%S 11,22,46,90,160,240,346,466,698,936,1188,1560,1810,2074,2550,3188,

%T 3666,4158,4830,5262,5850,6646,7484,8734,9900,10510,11130,11776,12444,

%U 14482,16774,18086,19192,20862,22656,23870,25758,27394,29070,31148,32590,34764,37060

%N a(n) = prime(n)*prime(n+1) + prime(n+2).

%F a(n) = A006094(n) + A000040(n+2). - _Elmo R. Oliveira_, Jan 19 2023

%e 2*3+5 = 11.

%p seq(ithprime(n)*ithprime(n+1)+ithprime(n+2), n=1..10^3); # _Muniru A Asiru_, Oct 01 2017

%t Table[Prime[n]*Prime[n + 1] + Prime[n + 2], {n, 50}] (* _Wesley Ivan Hurt_, Oct 29 2017 *)

%o (GAP)

%o A:=Filtered([1..10^5],IsPrime);; A292926:=List([1..Length(A)-2],n->A[n]*A[n+1]+A[n+2]); # _Muniru A Asiru_, Oct 01 2017

%Y Cf. A000040, A006094, A293206.

%K nonn,easy

%O 1,1

%A _Martin Michael Musatov_, Sep 29 2017

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 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)