A212155 Digits of one of the three 7-adic integers (-1)^(1/3).

5, 2, 0, 3, 6, 4, 0, 4, 2, 3, 2, 2, 1, 4, 5, 4, 5, 2, 0, 5, 5, 3, 1, 6, 4, 3, 2, 5, 3, 2, 3, 1, 0, 0, 4, 4, 4, 6, 4, 2, 6, 0, 0, 5, 1, 2, 5, 4, 3, 2, 5, 3, 2, 6, 3, 3, 4, 2, 2, 2, 1, 5, 6, 2, 6, 4, 6, 3, 5, 6, 4, 0, 5, 1, 4, 1, 1, 0, 6, 0, 4, 2, 2, 4, 5, 0, 3, 2, 1, 1, 5, 6, 2, 4, 2, 2, 1, 1, 5, 3

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

Links

Table of n, a(n) for n=0..99.

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

Cf. A212153 (approximations of (-1)^(1/3)), A212152 (digits of another cube root of -1), 6*A000012 (digits of -1).

Cf. A210850, A210851 (digits of the 5-adic integers sqrt(-1)); A319297, A319305, A319555 (digits of the 7-adic integers 6^(1/3)).

Sequence in context: A334708 A201528 A093814 * A269328 A063377 A296493

Adjacent sequences: A212152 A212153 A212154 * A212156 A212157 A212158

Keyword

nonn,easy

Author

Wolfdieter Lang, May 02 2012

Status

approved