Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136347
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136347 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 are coprime to m. +0
2
1, 1, 2, 2, 2, 5, 6, 6, 6, 6, 3, 4, 4, 4, 4, 4, 15, 15, 15, 15, 15, 15, 3, 3, 3, 3, 3, 3, 3, 29, 30, 31, 32, 33, 34, 35, 35, 35, 35, 35, 35, 35, 35, 28, 28, 28, 28, 28, 28, 28, 28, 28, 32, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 23 (list; graph; listen)
OFFSET

1,3

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

Among the first 30 terms of the sequence the run of seven 3's (from a(23) to a(29)) is the longest run of consecutive equal terms. (So m = 7.) Among the first 30 terms of the sequence, all 30 terms are coprime to 7. So a(31) = 30.

CROSSREFS

Cf. A136348.

Adjacent sequences: A136344 A136345 A136346 this_sequence A136348 A136349 A136350

Sequence in context: A123953 A097006 A033306 this_sequence A145876 A039878 A039886

KEYWORD

more,nonn

AUTHOR

Leroy Quet Dec 25 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research