|
Search: id:A008854
|
|
|
| A008854 |
|
Numbers that are congruent to {0, 1, 4} mod 5. |
|
+0
1
|
|
| 0, 1, 4, 5, 6, 9, 10, 11, 14, 15, 16, 19, 20, 21, 24, 25, 26, 29, 30, 31, 34, 35, 36, 39, 40, 41, 44, 45, 46, 49, 50, 51, 54, 55, 56, 59, 60, 61, 64, 65, 66, 69, 70, 71, 74, 75, 76, 79, 80, 81, 84, 85, 86, 89, 90, 91, 94, 95, 96, 99, 100, 101, 104, 105, 106, 109
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
n^3 and n have same last digit.
|
|
REFERENCES
|
L. E. Dickson, History of the Theory of Numbers. Carnegie Institute Public. 256, Washington, DC, Vol. 1, 1919; Vol. 2, 1920; Vol. 3, 1923, see vol. 1, p. 459.
|
|
FORMULA
|
Partial sums of (0, 1, 3, 1, 1, 3, 1, 1, 3, 1,...). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 19 2008
|
|
MAPLE
|
for n to 1000 do if n^3 - n mod 10 = 0 then print(n); fi; od;
|
|
CROSSREFS
|
Sequence in context: A139546 A029776 A114454 this_sequence A062726 A159629 A082812
Adjacent sequences: A008851 A008852 A008853 this_sequence A008855 A008856 A008857
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
