|
| |
|
|
A002987
|
|
a(1) = 1; a(2) = 2; a(n) == a(k) (mod n-k) for all 1 < k < n.
(Formerly M0169)
|
|
2
| |
|
|
1, 2, 1, 4, 5, 46, 37, 176, 289, 1450, 641, 24652, 15061, 18734, 110125, 46216, 3137, 1460386, 10506529, 78796820, 77855941, 123250702, 55222421, 3066673744, 54926785, 4846380026, 20185744177, 58863278476, 7499028629, 1410916015630
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
REFERENCES
| S. A. Burr, personal communication.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n = 1..200
|
|
|
MATHEMATICA
| t = {1, 2}; Do[AppendTo[t, ChineseRemainder[t, Reverse[Range[Length[t]]]]], {n, 3, 30}] (* T. D. Noe, Dec 29 2011 *)
|
|
|
CROSSREFS
| Sequence in context: A091232 A137424 A083007 * A188925 A063872 A199909
Adjacent sequences: A002984 A002985 A002986 * A002988 A002989 A002990
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
