This site is supported by donations to The OEIS Foundation.

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A145523 Least integer k>0 such that A000041(k) is divisible by 2^n. 2
 1, 2, 11, 11, 15, 66, 66, 96, 96, 96, 96, 96, 3693, 15005, 18978, 18978, 18978, 43002, 55943, 972190, 1151214, 2799146, 15519397, 15519397, 15519397, 122101417, 210553237, 289585489, 473093534 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS The requirement a(n)>0 is somewhat arbitrary, chosen for agreement with A046641; a(n)>=0 would have been possible, too, yielding a(0)=0. a(29) > 10^9. LINKS FORMULA a(n) = A046641(2^n) PROG (Other) (*sh*) i=1; c=1; while [ \$c -le 21 ]; do echo -n `./A046641 \$i`", "; c=`expr \$c + 1`; i=`expr \$i + \$i`; done [From M. F. Hasler, Oct 18 2008] CROSSREFS Sequence in context: A086862 A027828 A106371 * A168413 A265561 A265545 Adjacent sequences:  A145520 A145521 A145522 * A145524 A145525 A145526 KEYWORD more,nonn AUTHOR M. F. Hasler, Oct 12 2008 EXTENSIONS more terms & shell script. M. F. Hasler, Oct 18 2008 a(22)-a(28) from Max Alekseyev, Dec 16 2011 STATUS approved

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