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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055171 Cumulative counting sequence: method B (noun,adjective)-pairs with first term 1. 4
1, 1, 1, 1, 3, 1, 4, 3, 1, 1, 6, 3, 2, 4, 1, 1, 8, 3, 3, 4, 2, 6, 1, 2, 1, 1, 11, 3, 5, 4, 3, 6, 2, 2, 3, 8, 1, 1, 13, 3, 8, 4, 4, 6, 3, 2, 5, 8, 2, 11, 1, 5, 1, 1, 16, 3, 10, 4, 6, 6, 4, 2, 7, 8, 4, 11, 2, 5, 3, 13, 1, 1, 18, 3, 12, 4, 9, 6, 6, 2, 9, 8, 5, 11, 3, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

Segments (generated as at A055168):  1; 1,1; 1,3; 1,4,3,1; 1,6,3,2,4,1; ...  Conjecture: every positive integer occurs.

LINKS

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

EXAMPLE

Write 1, thus having 1 once, thus having 1 3 times, thus having 1 4 times and 3 once, etc.

MATHEMATICA

s = {1}; Do[s = Flatten[{s, {#, Count[s, #]} & /@ DeleteDuplicates[s]}], {24}]; s (* Peter J. C. Moses, Mar 21 2013 *)

CROSSREFS

Cf. A055168.

Sequence in context: A065256 A016573 A191818 * A101038 A064883 A090844

Adjacent sequences:  A055168 A055169 A055170 * A055172 A055173 A055174

KEYWORD

nonn

AUTHOR

Clark Kimberling, Apr 27 2000

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 December 12 22:06 EST 2019. Contains 329963 sequences. (Running on oeis4.)