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!)
A147967 a(n) = n*(A001223(n)-1) = n*A046933(n). 1

%I #10 Nov 22 2021 10:50:07

%S 0,2,3,12,5,18,7,24,45,10,55,36,13,42,75,80,17,90,57,20,105,66,115,

%T 168,75,26,81,28,87,390,93,160,33,306,35,180,185,114,195,200,41,378,

%U 43,132,45,506,517,144,49,150,255,52,477

%N a(n) = n*(A001223(n)-1) = n*A046933(n).

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

%t Module[{nn=60,gps},gps=Differences[Prime[Range[nn+1]]]-1;Times@@@ Thread[ {Range[nn],gps}]] (* _Harvey P. Dale_, Nov 07 2020 *)

%Y Cf. A001223 ("gap" with its usual meaning), A046933, A141042, A147965, A147966.

%K easy,nonn

%O 1,2

%A _Omar E. Pol_, Nov 17 2008

%E Definition clarified by _N. J. A. Sloane_, Nov 22 2021 at the suggestion of _Harvey P. Dale_.

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 September 15 04:39 EDT 2024. Contains 375931 sequences. (Running on oeis4.)