Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066880
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066880 Biased numbers: n such that all terms of the sequence f(n), f(f(n)), f(f(f(n))), ..., 1, where f(k) = Floor(k/2), are odd. +0
2
2, 3, 6, 7, 14, 15, 30, 31, 62, 63, 126, 127, 254, 255, 510, 511, 1022, 1023, 2046, 2047, 4094, 4095, 8190, 8191, 16382, 16383, 32766, 32767, 65534, 65535, 131070, 131071, 262142, 262143, 524286, 524287, 1048574, 1048575, 2097150, 2097151, 4194302 (list; graph; listen)
OFFSET

1,1

COMMENT

It should not be hard to prove that this sequence consists of pairs 2^k - 2, 2^k - 1, where k > 2.

EXAMPLE

The sequence corresponding to 14 is 7, 3, 1, all of whose terms are odd. So 14 is a term of the sequence.

CROSSREFS

Adjacent sequences: A066877 A066878 A066879 this_sequence A066881 A066882 A066883

Sequence in context: A018511 A092482 A075427 this_sequence A075426 A018606 A117087

KEYWORD

easy,nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Jan 21 2002

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), Jun 11 2002

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research