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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136348 a(1)=1. Let m be the number of terms in the longest run of consecutive equal terms from among the first n terms of the sequence. a(n+1) = the number of terms, from among the first n terms of the sequence, that divide m. 1
1, 1, 2, 3, 3, 3, 5, 5, 5, 5, 3, 3, 3, 3, 3, 6, 6, 6, 6, 6, 6, 17, 17, 17, 17, 17, 17, 17, 2, 2, 2, 2, 2, 2, 2, 2, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 25 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

EXAMPLE

Among the first 20 terms of the sequence the run of five 3's (from a(11) to a(15)) is the longest run of consecutive equal terms. (So m = 5.) Among the first 20 terms of the sequence, there are six which divide 5. (a(1),a(2),a(7),a(8),a(9),a(10)) So a(21) = 6.

CROSSREFS

Cf. A136347.

Sequence in context: A111912 A096288 A184995 * A137847 A164023 A097224

Adjacent sequences:  A136345 A136346 A136347 * A136349 A136350 A136351

KEYWORD

more,nonn

AUTHOR

Leroy Quet Dec 25 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 18:22 EST 2012. Contains 205835 sequences.