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!)
A331858 a(n) = (2^p-1)*(2^(p-1))*((2^p-1)^2-2), where p is the n-th prime. 1
42, 1316, 475664, 131080256, 8783210218496, 2250975213522944, 147570574898545885184, 37778715690312487141376, 2475879193127080196116054016, 41538374636164863806350357434466304, 10633823951424046514111736193740701696, 178405961584350762488394070192754827810832384 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Integers a(1), a(2), a(4), a(8) corresponding to p = 2, 3, 7, 19 are also terms of A331805. - Bernard Schott, Feb 04 2020
LINKS
FORMULA
a(n) = A060286(n)*A093112(prime(n)). - M. F. Hasler, Jan 31 2020
MATHEMATICA
f[p_] := (2^p-1)*(2^(p-1))*((2^p-1)^2-2); f @ Prime @ Range[12] (* Amiram Eldar, Jan 29 2020 *)
PROG
(PARI) [(2^p-1)*((2^p-1)^2-2)<<(p-1) | p<-primes(12)] \\ or: a(n, p=prime(n))={...}. - M. F. Hasler, Jan 29 2020
CROSSREFS
Cf. A000040 (primes), A000396 (perfect numbers), A093112 ((2^n-1)^2-2), A060286 (2^(p-1)*(2^p-1)), A331805.
Sequence in context: A111780 A075922 A230939 * A331805 A348775 A238537
KEYWORD
nonn,easy
AUTHOR
G. L. Honaker, Jr., Jan 29 2020
STATUS
approved

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 June 6 15:29 EDT 2024. Contains 373131 sequences. (Running on oeis4.)