Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082662
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082662 Numbers n such that A001227(n) = A082647(n). +0
1
1, 2, 4, 6, 8, 12, 16, 20, 24, 28, 32, 40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 144, 160, 176, 192, 208, 224, 240, 256, 272, 288, 304, 320, 336, 352, 368, 384, 400, 416, 432, 448, 464, 480, 496, 512, 544, 576, 608, 640, 672, 704, 736, 768, 800 (list; graph; listen)
OFFSET

1,2

FORMULA

a(1) = 1. a(3*2^m + k - 2) = 2^(2m+1) + (k-1)*2^(m+1), where m >= 0, k=1..(3*2^m).

CROSSREFS

Adjacent sequences: A082659 A082660 A082661 this_sequence A082663 A082664 A082665

Sequence in context: A064527 A007694 A050622 this_sequence A064522 A036912 A097921

KEYWORD

easy,nonn

AUTHOR

Naohiro Nomoto (n_nomoto(AT)yabumi.com), May 18 2003

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 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research