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

%I #16 Oct 13 2013 03:14:25

%S 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,

%T 10,10,11,11,11,11,11,12,12,12,12,12,12,13,13,13,13,13,13,14,14,14,14,

%U 14,14,15,15,15,15,15,15,16,16,16,16,16,16,16,17,17,17,17,17

%N Modified Golomb's sequence: a(n) is the number of times n occurs, starting with a(1)=2.

%H Charles R Greathouse IV, <a href="/A210691/b210691.txt">Table of n, a(n) for n = 1..10000</a>

%e a(5)=4 because there are four fives in the series.

%o (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

%Y Cf. A001462

%K nonn

%O 1,1

%A _Thomas S. Pedigo_, Mar 30 2012

%E a(21)-a(75) from _Charles R Greathouse IV_, Apr 11 2012

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 September 4 15:15 EDT 2024. Contains 375683 sequences. (Running on oeis4.)