The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A055174 Cumulative counting sequence: method B (noun,adjective)-pairs with first term 2. 6
 2, 2, 1, 2, 2, 1, 1, 2, 4, 1, 3, 2, 5, 1, 4, 4, 1, 3, 1, 2, 6, 1, 7, 4, 3, 3, 2, 5, 1, 2, 8, 1, 9, 4, 4, 3, 4, 5, 2, 6, 1, 7, 1, 2, 10, 1, 12, 4, 7, 3, 5, 5, 3, 6, 2, 7, 2, 8, 1, 9, 1, 2, 13, 1, 15, 4, 8, 3, 7, 5, 5, 6, 3, 7, 4, 8, 2, 9, 2, 10, 1, 12, 1, 2, 16, 1, 18 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Segments (generated as at A055168): 2; 2,1; 2,2,1,1; 2,4,1,3,2,5; ... Conjecture: every positive integer occurs. LINKS Seiichi Manyama, Table of n, a(n) for n = 1..10000 EXAMPLE Write 2, thus having 2 once, thus having 2 twice and 1 once, thus having 2 4 times and 1 3 times and 2 5 times, etc. MATHEMATICA s = {2}; Do[s = Flatten[{s, {#, Count[s, #]} & /@ DeleteDuplicates[s]}], {24}]; s (* Peter J. C. Moses, Mar 21 2013 *) CROSSREFS Cf. A055168. Sequence in context: A192064 A225182 A014710 * A096369 A332289 A102297 Adjacent sequences: A055171 A055172 A055173 * A055175 A055176 A055177 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 9 19:36 EST 2022. Contains 358703 sequences. (Running on oeis4.)