Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094591
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094591 a(0) = 1; a(n) = n + (largest element of {a} <= n). +0
3
1, 2, 4, 5, 8, 10, 11, 12, 16, 17, 20, 22, 24, 25, 26, 27, 32, 34, 35, 36, 40, 41, 44, 45, 48, 50, 52, 54, 55, 56, 57, 58, 64, 65, 68, 70, 72, 73, 74, 75, 80, 82, 83, 84, 88, 90, 91, 92, 96, 97, 100, 101, 104, 105, 108, 110, 112, 114, 116, 117, 118, 119, 120, 121, 128, 130 (list; graph; listen)
OFFSET

0,2

COMMENT

Is this A037988 + 1 ?

A self-describing sequence. Pick any number n; this n says: "There are n terms in the sequence which are < 2n". This sequence is the slowest increasing one with this property. See comments on A037988. - Eric Angelini (eric.angelini(AT)kntv.be), Jun 15 2007

LINKS

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

CROSSREFS

Sequence in context: A095031 A100598 A079537 this_sequence A134191 A026138 A026170

Adjacent sequences: A094588 A094589 A094590 this_sequence A094592 A094593 A094594

KEYWORD

nonn,easy

AUTHOR

Leroy Quet Jun 07 2004

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jun 11 2004

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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research