login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

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

1,1

COMMENTS

Segments (generated as at A055168):  3; 3,1; 3,2,1,1; 3,3,1,3,2,1; ...

Conjecture: every positive integer occurs.

LINKS

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

EXAMPLE

Write 3, thus having 3 once, thus having 3 twice and 1 once, thus having 3 3 times and 1 3 times and 2 once, etc.

MATHEMATICA

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

CROSSREFS

Cf. A055168.

Sequence in context: A133695 A138114 A124330 * A030778 A324078 A068119

Adjacent sequences:  A055174 A055175 A055176 * A055178 A055179 A055180

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 2 14:09 EST 2021. Contains 349445 sequences. (Running on oeis4.)