|
|
A056020
|
|
Numbers that are congruent to +-1 mod 9.
|
|
27
|
|
|
1, 8, 10, 17, 19, 26, 28, 35, 37, 44, 46, 53, 55, 62, 64, 71, 73, 80, 82, 89, 91, 98, 100, 107, 109, 116, 118, 125, 127, 134, 136, 143, 145, 152, 154, 161, 163, 170, 172, 179, 181, 188, 190, 197, 199, 206, 208, 215, 217, 224, 226, 233, 235, 242, 244, 251, 253
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Or, numbers k such that k^2 == 1 (mod 9).
Or, numbers k such that the iterative cycle j -> sum of digits of j^2 when started at k contains a 1. E.g., 8 -> 6+4 = 10 -> 1+0+0 = 1 and 17 -> 2+8+9 = 19 -> 3+6+1 = 10 -> 1+0+0 = 1. - Asher Auel, May 17 2001
|
|
LINKS
|
|
|
FORMULA
|
O.g.f.: 1 + 5/(4(x+1)) + 27/(4(-1+x)) + 9/(2(-1+x)^2).
a(n) = a(n-2) + 9, for n > 2.
a(n) = 9*A000217(n-1) + 1 - 2*Sum_{i=1..n-1} a(i), n > 1. (End)
E.g.f.: 1 + ((18*x - 9)*exp(x) + 5*exp(-x))/4. - David Lovler, Sep 04 2022
|
|
MATHEMATICA
|
Select[ Range[ 300 ], PowerMod[ #, 2, 3^2 ]==1& ]
|
|
PROG
|
(Haskell)
a056020 n = a056020_list !! (n-1)
a05602_list = 1 : 8 : map (+ 9) a056020_list
|
|
CROSSREFS
|
Cf. A005408, A019676, A019968, A047209, A007310, A047336, A175885, A091998, A175886, A113801, A175887.
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|