login
A056024
Numbers k such that k^10 == 1 (mod 11^2).
12
1, 3, 9, 27, 40, 81, 94, 112, 118, 120, 122, 124, 130, 148, 161, 202, 215, 233, 239, 241, 243, 245, 251, 269, 282, 323, 336, 354, 360, 362, 364, 366, 372, 390, 403, 444, 457, 475, 481, 483, 485, 487, 493, 511, 524, 565, 578, 596, 602, 604, 606, 608, 614, 632
OFFSET
1,2
FORMULA
From Mike Sheppard, Feb 19 2025: (Start)
a(n) = a(n-1) + a(n-10) - a(n-11).
a(n) = a(n-10) + 11^2.
a(n) ~ (11^2/10)*n. (End)
MATHEMATICA
Select[ Range[ 800 ], PowerMod[ #, 10, 121 ]==1& ]
LinearRecurrence[{1, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1}, {1, 3, 9, 27, 40, 81, 94, 112, 118, 120, 122}, 65] (* Mike Sheppard, Feb 19 2025 *)
PROG
(PARI) a(n)=1+((n-1)\10)*121+[0, 2, 8, 26, 39, 80, 93, 111, 117, 119][(n-1)%10+1] \\ Charles R Greathouse IV, Apr 29 2026
CROSSREFS
Cf. A381319 (general case mod n^2).
Sequence in context: A036126 A045580 A070361 * A116475 A337948 A163791
KEYWORD
nonn,easy
AUTHOR
Robert G. Wilson v, Jun 08 2000
STATUS
approved