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!)
A026515 a(n) = length of n-th run of identical symbols in A026513. 0
1, 1, 3, 3, 1, 1, 7, 1, 3, 3, 1, 7, 1, 1, 3, 3, 1, 1, 7, 1, 6, 1, 8, 1, 3, 3, 1, 1, 7, 1, 3, 3, 1, 7, 1, 1, 3, 3, 1, 8, 1, 6, 1, 7, 1, 1, 3, 3, 1, 1, 7, 1, 3, 3, 1, 7, 1, 1, 3, 3, 1, 1, 7, 1, 6, 1, 8, 1, 3, 3, 1, 1, 7, 1, 6, 1, 7, 1, 1, 3, 3, 1, 8, 1, 6, 1, 8, 1, 3, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

CROSSREFS

Cf. A001285, A026513.

Sequence in context: A288266 A174116 A270273 * A075772 A142157 A119608

Adjacent sequences:  A026512 A026513 A026514 * A026516 A026517 A026518

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

a(63) onward corrected by Sean A. Irvine, Oct 05 2019

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 11 21:15 EST 2019. Contains 329937 sequences. (Running on oeis4.)