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!)
A125049 a(1) = 1. If a(n) is prime, a(n+1) = 2*a(n); otherwise, a(n+1) = 2*a(n) + 1. 1
1, 3, 6, 13, 26, 53, 106, 213, 427, 855, 1711, 3423, 6847, 13695, 27391, 54783, 109567, 219134, 438269, 876539, 1753079, 3506159, 7012318, 14024637, 28049275, 56098551, 112197103, 224394207, 448788415, 897576831, 1795153663, 3590307326 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = floor(c*2^n), where c = 0.8359335658... - Lorenzo Sauras Altuzarra, Jan 01 2023
MAPLE
a := proc(n)
local c, k:
c, k := 1, 1:
while c < n do
if isprime(k) then k := 2*k: else k := 2*k+1: fi:
c := c+1: od:
k: end: # Lorenzo Sauras Altuzarra, Jan 02 2023
MATHEMATICA
NestList[If[PrimeQ[#], 2#, 2#+1]&, 1, 40] (* Harvey P. Dale, Sep 01 2017 *)
CROSSREFS
Cf. A125050.
Sequence in context: A019300 A072762 A081254 * A267581 A320733 A164991
KEYWORD
nonn
AUTHOR
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 April 24 19:24 EDT 2024. Contains 371962 sequences. (Running on oeis4.)