login
The OEIS is supported by the many generous donors 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. 2

%I #12 Aug 02 2018 17:06:50

%S 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,

%T 2,2,2,2,2,11,11,11,11,11,11,11,11,11,10,10,10,10,10,10,10,10,10,10,

%U 25,25,25,25,25,25,25,25,25,25,25,11,12,12,12,12,12

%N 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.

%H Rémy Sigrist, <a href="/A136348/b136348.txt">Table of n, a(n) for n = 1..10000</a>

%H Rémy Sigrist, <a href="/A136348/a136348.gp.txt">PARI program for A136348</a>

%e 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.

%o (PARI) See Links section.

%Y Cf. A136347.

%K nonn,look

%O 1,3

%A _Leroy Quet_, Dec 25 2007

%E More terms from _Rémy Sigrist_, Aug 02 2018

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 16:41 EDT 2024. Contains 375517 sequences. (Running on oeis4.)