Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002987
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002987 a(1) = 1; a(2) = 2; a(n) == a(k) (mod n-k) for all 1 < k < n.
(Formerly M0169)
+0
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; listen)
OFFSET

1,2

REFERENCES

S. A. Burr, personal communication.

CROSSREFS

Sequence in context: A091232 A137424 A083007 this_sequence A063872 A033884 A062344

Adjacent sequences: A002984 A002985 A002986 this_sequence A002988 A002989 A002990

KEYWORD

nonn

AUTHOR

njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research