Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084693
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084693 a(n) is smallest positive integer not already in the sequence such that every partial sum is square-free. +0
1
1, 2, 3, 4, 5, 6, 8, 9, 13, 7, 11, 10, 12, 14, 17, 15, 18, 19, 16, 20, 21, 22, 24, 25, 27, 26, 28, 23, 29, 30, 32, 33, 31, 34, 36, 38, 37, 35, 40, 41, 39, 42, 43, 45, 46, 44, 48, 49, 51, 50, 47, 52, 55, 53, 56, 57, 54, 58, 59, 60, 61, 63, 64, 65, 62, 66, 67, 68, 69, 70, 72, 73 (list; graph; listen)
OFFSET

0,2

COMMENT

Does every positive integer occur in the sequence?

The longest string of consecutive numbers is 6.

CROSSREFS

Sequence in context: A093110 A052063 A129525 this_sequence A121644 A002242 A039125

Adjacent sequences: A084690 A084691 A084692 this_sequence A084694 A084695 A084696

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 04 2003

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Dec 30 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research