Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088939
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088939 Runs are reduced to one term in A088936. +0
5
1, 2, 3, 2, 4, 3, 4, 2, 5, 4, 5, 4, 5, 3, 5, 4, 5, 2, 6, 5, 6, 5, 6, 5, 6, 4, 6, 5, 6, 5, 6, 5, 6, 4, 6, 5, 6, 5, 6, 3, 6, 5, 6, 5, 6, 5, 6, 4, 6, 5, 6, 2, 7, 6, 7, 6, 7, 6, 7, 6, 7, 5, 7, 6, 7, 6, 7, 6, 7, 6, 7, 5, 7, 6, 7, 6, 7, 6, 7, 6, 7 (list; graph; listen)
OFFSET

1,2

FORMULA

Is sum(k=1, n, a(k)) asymptotic to c*n*log(n) for some c?

EXAMPLE

A run of 5 7's ...6,7, 7, 7, 7, 7,6,... is replaced by its

own value 7 which gives ...6,7,6,...

CROSSREFS

Cf. A088936, A088937, A088938, A088940 (partial sums).

Sequence in context: A072645 A135817 A122060 this_sequence A004596 A118653 A076753

Adjacent sequences: A088936 A088937 A088938 this_sequence A088940 A088941 A088942

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 25 2003

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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research