|
|
A145679
|
|
Lower limit of backward value of 2^n and n!.
|
|
3
|
|
|
2, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
For n!, omitting the trailing sequence zeros. - Simon Plouffe, Mar 05 2017
The terms are deduced from sequence A023415.
The sum of constants in A145679 and A023415 is conjectured to be 11 exactly.
|
|
LINKS
|
|
|
PROG
|
(Python)
# lower limit of backward value of 2^n
a, i=2, 0; x=a
while 1:
i+=1; print x, ', ' ,
if a%2**(i+1) == 0: x=0
else: x=1; a+=10**i
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|