login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097686 a(n+1) = if a(n) is even then a(n)/2 else (a(n) + number of earlier occurrences of a(n)), a(1) = 1. 2
1, 1, 2, 1, 3, 3, 4, 2, 1, 4, 2, 1, 5, 5, 6, 3, 5, 7, 7, 8, 4, 2, 1, 6, 3, 6, 3, 7, 9, 9, 10, 5, 8, 4, 2, 1, 7, 10, 5, 9, 11, 11, 12, 6, 3, 8, 4, 2, 1, 8, 4, 2, 1, 9, 12, 6, 3, 9, 13, 13, 14, 7, 11, 13, 15, 15, 16, 8, 4, 2, 1, 10, 5, 10, 5, 11, 14, 7, 12, 6, 3, 10, 5, 12, 6, 3, 11, 15, 17, 17, 18, 9, 14 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

a(A097687(n))=n and a(m)<n for m < A097687(n);

A097688(n) = #{k: a(k)=1, 1<=k<=n}.

LINKS

Table of n, a(n) for n=1..93.

CROSSREFS

Cf. A001221.

Sequence in context: A265144 A263275 A308057 * A082666 A057938 A144623

Adjacent sequences:  A097683 A097684 A097685 * A097687 A097688 A097689

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Aug 19 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 16 18:45 EDT 2019. Contains 327117 sequences. (Running on oeis4.)