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!)
A347296 a(1) = 1; for n >= 1, if a(n) is even then a(n+1) = a(n) / 2, otherwise, say a(n) is the k-th odd term in the sequence, a(n+1) = a(n) + a(k). 2
1, 2, 1, 3, 4, 2, 1, 4, 2, 1, 5, 7, 8, 4, 2, 1, 5, 7, 8, 4, 2, 1, 6, 3, 10, 5, 13, 17, 19, 20, 10, 5, 10, 5, 12, 6, 3, 11, 15, 17, 18, 9, 15, 18, 9, 19, 24, 12, 6, 3, 16, 8, 4, 2, 1, 18, 9, 28, 14, 7, 27, 37, 42, 21, 31, 36, 18, 9, 21, 27, 30, 15, 26, 13, 28 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
This sequence is a variant of A350877; here we add terms of the sequence, there prime numbers.
LINKS
EXAMPLE
a(1) = 1.
a(2) = a(1) + a(1) = 2 as a(1) is the 1st odd term.
a(3) = a(2) / 2 = 1 as a(2) is even.
a(4) = a(3) + a(2) = 3 as a(3) is the 2nd odd term.
a(5) = a(4) + a(3) = 4 as a(4) is the 3rd odd term.
PROG
(PARI) k=0; for (n=1, #a=vector(75), print1 (a[n]=if (n==1, 1, a[n-1]%2==0, a[n-1]/2, a[n-1]+a[k++])", "))
CROSSREFS
Sequence in context: A004741 A352840 A133923 * A341231 A334081 A125158
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Jan 23 2022
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 August 5 20:07 EDT 2024. Contains 374954 sequences. (Running on oeis4.)