The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A309073 Split the sequence A247476 into nonempty chunks of minimal length such that for d = 1..9, the number of terms with leading digit d is even; a(n) is the length of the n-th chunk. 1
 26, 6, 6, 76, 14, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 712, 38, 280, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS This sequence corresponds to the first difference of A309063. LINKS Rémy Sigrist, Table of n, a(n) for n = 1..10000 Rémy Sigrist, Illustration of first terms FORMULA a(n) = A309063(n+1) - A309063(n). a(n) = A055642(A309072(n)). EXAMPLE See illustration of first terms in Links section. CROSSREFS Cf. A247476, A309063, A309072. Sequence in context: A040659 A073029 A040657 * A277215 A331481 A040656 Adjacent sequences: A309070 A309071 A309072 * A309074 A309075 A309076 KEYWORD nonn,base AUTHOR Rémy Sigrist, Jul 10 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 18 21:39 EDT 2024. Contains 372666 sequences. (Running on oeis4.)