|
Search: id:A145523
|
|
|
| A145523 |
|
Least integer k>0 such that A000041(k) is divisible by 2^n. |
|
+0
3
|
|
| 1, 2, 11, 11, 15, 66, 66, 96, 96, 96, 96, 96, 3693, 15005, 18978, 18978, 18978, 43002, 55943, 972190, 1151214, 2799146
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
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(22) > 10^7 [From M. F. Hasler (MHasler(AT)univ-ag.fr), Oct 18 2008]
|
|
FORMULA
|
a(n) = A046641(2^n)
|
|
PROGRAM
|
(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 (MHasler(AT)univ-ag.fr), Oct 18 2008]
|
|
CROSSREFS
|
A000041, A046641, A000123, A046063
Sequence in context: A086862 A027828 A106371 this_sequence A153705 A090009 A153706
Adjacent sequences: A145520 A145521 A145522 this_sequence A145524 A145525 A145526
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
M. F. Hasler (Maximilian.Hasler(AT)gmail.com), Oct 12 2008
|
|
EXTENSIONS
|
more terms & shell script. M. F. Hasler (MHasler(AT)univ-ag.fr), Oct 18 2008
|
|
|
Search completed in 0.002 seconds
|
