OFFSET
0,1
COMMENTS
See A210853 for comments and an approximation to this 7-adic number, called there v. See also A048898 for references on p-adic numbers.
a(n), n>=1, is the (unique) solution of the linear congruence 3 * b(n)^2 * a(n) + c(n) == 0 (mod 7), with b(n):=A212153(n) and c(n):=A212154(n). a(0) = 5, one of the three solutions of X^3+1 == 0 (mod 7).
Since b(n) == 5 (mod 7), a(n) == 4 * c(n) (mod 7) for n>0. - Álvar Ibeas, Feb 20 2017
With a(0) = 4, this is the digits of one of the three cube root of 1, the one that is congruent to 4 modulo 7. - Jianing Song, Aug 26 2022
FORMULA
a(n) = (b(n+1) - b(n))/7^n, n>=1, with b(n):=A212153(n), defined by a recurrence given there. One also finds there a Maple program for b(n). a(0)=5.
a(n) = 6 - A212152(n), for n>0. - Álvar Ibeas, Feb 21 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Wolfdieter Lang, May 02 2012
STATUS
approved