OFFSET
0,2
COMMENTS
This is the 10's complement of A225406.
LINKS
Seiichi Manyama, Table of n, a(n) for n = 0..10000
FORMULA
Define the sequence {b(n)} by the recurrence b(0) = 0 and b(1) = 1, b(n) = b(n-1) + 3 * (b(n-1)^3 + 9) mod 10^n for n > 1, then a(n) = (b(n+1) - b(n))/10^n. - Seiichi Manyama, Aug 13 2019
EXAMPLE
1^3 == -9 (mod 10).
31^3 == -9 (mod 10^2).
431^3 == -9 (mod 10^3).
9431^3 == -9 (mod 10^4).
39431^3 == -9 (mod 10^5).
339431^3 == -9 (mod 10^6).
PROG
(PARI) n=0; for(i=1, 100, m=(10^i-9); for(x=0, 9, if(((n+(x*10^(i-1)))^3)%(10^i)==m, n=n+(x*10^(i-1)); print1(x", "); break)))
(PARI) Vecrev(digits(truncate((-9+O(10^100))^(1/3)))) \\ Seiichi Manyama, Aug 04 2019
(PARI) N=100; Vecrev(digits(lift(chinese(Mod((-9+O(2^N))^(1/3), 2^N), Mod((-9+O(5^N))^(1/3), 5^N)))), N) \\ Seiichi Manyama, Aug 04 2019
(Ruby)
def A225409(n)
ary = [1]
a = 1
n.times{|i|
b = (a + 3 * (a ** 3 + 9)) % (10 ** (i + 2))
ary << (b - a) / (10 ** (i + 1))
a = b
}
ary
end
p A225409(100) # Seiichi Manyama, Aug 13 2019
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Aswini Vaidyanathan, May 07 2013
STATUS
approved