Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097687
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097687 Smallest m such that A097686(m)=n. +0
2
1, 3, 5, 7, 13, 15, 18, 20, 29, 31, 41, 43, 59, 61, 65, 67, 89, 91, 115, 117, 133, 135, 153, 155, 173, 175, 207, 209, 243, 245, 250, 252, 305, 307, 338, 340, 389, 391, 407, 409, 447, 449, 527, 529, 554, 556, 613, 615, 663, 665, 699, 701, 761, 763, 788, 790, 869 (list; graph; listen)
OFFSET

1,2

COMMENT

a(2*n) = a(2*n-1) + 2.

CROSSREFS

Sequence in context: A024909 A063241 A007591 this_sequence A032911 A157834 A008996

Adjacent sequences: A097684 A097685 A097686 this_sequence A097688 A097689 A097690

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 19 2004

page 1

Search completed in 0.004 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research