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!)
A210691 Modified Golomb's sequence: a(n) is the number of times n occurs, starting with a(1)=2. 1
2, 1, 1, 3, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
EXAMPLE
a(5)=4 because there are four fives in the series.
PROG
(PARI) v=List([2, 1, 1]); for(n=3, 50, for(i=1, v[n], listput(v, n))); Vec(v) \\ Charles R Greathouse IV, Apr 11 2012
CROSSREFS
Sequence in context: A226209 A302097 A307277 * A262175 A278028 A124424
KEYWORD
nonn
AUTHOR
Thomas S. Pedigo, Mar 30 2012
EXTENSIONS
a(21)-a(75) from Charles R Greathouse IV, Apr 11 2012
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 10:11 EDT 2024. Contains 371935 sequences. (Running on oeis4.)