|
|
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
|
|
|
PROG
|
(sh) i=1; c=1; while [ $c -le 21 ]; do echo -n `./A046641 $i`", "; c=`expr $c + 1`; i=`expr $i + $i`; done # M. F. Hasler, Oct 18 2008
|
|
CROSSREFS
|
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|