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!)
A072087 Least k such that A072084(k) = n. 3
1, 3, 7, 9, 31, 21, 127, 27, 49, 93, 3583, 63, 8191, 381, 217, 81, 131071, 147, 524287, 279, 889, 10749, 14680063, 189, 961, 24573, 343, 1143, 1073479679, 651, 2147483647, 243, 25081, 393213, 3937, 441, 266287972351, 1572861, 57337, 837 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
If p is a Mersenne prime then a(p) = 2^p - 1 (A000120(2^n-1)=n), for other primes p: a(p) > 2^p - 1.
LINKS
FORMULA
Completely multiplicative with a(p) = A061712(p). - David W. Wilson, Aug 03 2005
Sum_{n>=1} 1/a(n) = Product_{p prime} 1/(1 - 1/A061712(p)) = 1.82343415954263449963... . - Amiram Eldar, Nov 02 2023
MATHEMATICA
s[n_] := s[n] = Module[{p = 2}, While[DigitCount[p, 2, 1] != n, p = NextPrime[p]]; p]; f[p_, e_] := s[p]^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 22] (* Amiram Eldar, Nov 02 2023 *)
PROG
(Haskell)
a072087 1 = 1
a072087 n = product $ map a061712 $ a027746_row n
-- Reinhard Zumkeller, Feb 10 2013
CROSSREFS
Sequence in context: A057840 A339614 A246659 * A328462 A328233 A031161
KEYWORD
nonn,mult
AUTHOR
Reinhard Zumkeller, Jun 14 2002
EXTENSIONS
More terms from David W. Wilson, Aug 03 2005
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 May 13 02:41 EDT 2024. Contains 372497 sequences. (Running on oeis4.)