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!)
A045973 a(1)=10; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+1}^e_i * Product p_{i+3}^e_i. 6
10, 21, 55, 441, 91, 1155, 187, 9261, 3025, 1911, 247, 24255, 391, 3927, 5005, 194481, 551, 63525, 713, 40131, 10285, 5187, 1073, 509355, 8281, 8211, 166375, 82467, 1271, 105105, 1591, 4084101, 13585, 11571, 17017, 1334025, 1927, 14973, 21505, 842751 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
REFERENCES
From a puzzle proposed by Marc LeBrun.
LINKS
FORMULA
Sum_{n>=1} 1/a(n) = -9/10 + Product_{k>=1} (1+1/(prime(k)*prime(k+4)-1)) = 0.2602421684... . - Amiram Eldar, Sep 19 2023
MATHEMATICA
f[p_, e_] := NextPrime[p]^e * NextPrime[p, 3]^e; a[1] = 10; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Sep 19 2023 *)
CROSSREFS
Sequence in context: A090076 A231966 A156592 * A095679 A095192 A356761
KEYWORD
easy,nonn
AUTHOR
EXTENSIONS
More terms from David W. Wilson
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 July 24 02:29 EDT 2024. Contains 374575 sequences. (Running on oeis4.)