Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062547
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062547 a(n) is least odd integer not a partial sum of 1, 3, ..., a(n-1). +0
2
1, 3, 5, 7, 17, 19, 53, 55, 161, 163, 485, 487, 1457, 1459, 4373, 4375, 13121, 13123, 39365, 39367, 118097, 118099, 354293, 354295, 1062881, 1062883, 3188645, 3188647, 9565937, 9565939, 28697813, 28697815, 86093441, 86093443, 258280325 (list; graph; listen)
OFFSET

0,2

COMMENT

Odd indexed terms = A048473 and even indexed terms a(2n) = a(2n-1)+2;

EXAMPLE

Partial sums of 1;3;5 are 1;3;4;5;6;8;9 and 7 is the least missing odd integer, hence the next term is 7.

MATHEMATICA

Table[ -1+ 2 3^Floor[k/2]+2 Mod[k, 2], {k, 0, 36}]

CROSSREFS

Cf. A048473, A062548.

Sequence in context: A092951 A001259 A087126 this_sequence A125739 A122853 A137258

Adjacent sequences: A062544 A062545 A062546 this_sequence A062548 A062549 A062550

KEYWORD

nonn

AUTHOR

Wouter Meeussen (wouter.meeussen(AT)pandora.be), Jun 26 2001

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 December 19 21:04 EST 2009. Contains 171054 sequences.


AT&T Labs Research