login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063446 d[n+1]=2d[n] where d[]=A000005. 6
1, 5, 7, 13, 37, 39, 49, 55, 61, 65, 69, 73, 77, 87, 129, 134, 157, 183, 185, 193, 194, 221, 237, 247, 249, 254, 265, 275, 277, 295, 309, 313, 321, 327, 343, 363, 365, 397, 398, 417, 421, 437, 454, 455, 457, 458, 469, 471, 473, 475, 482, 493, 497, 505, 517 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

EXAMPLE

n=77,2d[77]=2.4=8=d[78]

PROG

(PARI) { n=0; for (m=1, 10^9, if (numdiv(m + 1) == 2*numdiv(m), write("b063446.txt", n++, " ", m); if (n==1000, break)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 21 2009]

CROSSREFS

A000005.

Sequence in context: A168609 A102903 A018464 * A064600 A174874 A109904

Adjacent sequences:  A063443 A063444 A063445 * A063447 A063448 A063449

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 24 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 04:47 EST 2012. Contains 205860 sequences.