|
|
|
|
1, 1, -2, 1, 1, -2, -2, 1, 1, 1, -2, -2, 1, -2, -2, 1, 1, 1, -2, 1, 1, -2, -2, -2, 1, 1, -2, -2, 1, -2, -2, 1, 1, 1, -2, 1, 1, -2, -2, 1, 1, 1, -2, -2, 1, -2, -2, -2, 1, 1, -2, 1, 1, -2, -2, -2, 1, 1, -2, -2, 1, -2, -2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
FORMULA
|
a(4*n-3) = 1, a(4*n-1) = -2, a(2*n) = a(n) for n > 0.
|
|
PROG
|
(Python)
n, f, i, p, q = 1, 1, 0, 0, 1
while i < 1000000:
....i, p, q = i+1, p*10, q*10
....if i == f:
........p, n = p+1, n+1
........f = f*n
n, a, j = 0, 0, 0
while p%q > 0:
....a, f, p, q = a+1, p//q, q, p%q
....if f == 8:
........n = n+1
........print(n, a-1-8*n)
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|