Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064935
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064935 Numbers n such that (n+3)^(n+2) mod (n+1) = n. +0
2
4, 64, 376, 1188, 1468, 25804, 58588, 134944, 137344, 170584, 272608, 285388, 420208, 538732, 592408, 618448, 680704, 778804, 1163064, 1520440, 1700944, 2099200, 2831008, 4020028, 4174168, 4516108, 5059888, 5215768, 5447272 (list; graph; listen)
OFFSET

1,1

EXAMPLE

For example, (4+3)^(4+2) mod (4+1) = 7^6 mod 5 = 117649 mod 5 = 4

CROSSREFS

Equals A055685(n+1) - 2.

Sequence in context: A110258 A030994 A141046 this_sequence A030098 A087045 A103751

Adjacent sequences: A064932 A064933 A064934 this_sequence A064936 A064937 A064938

KEYWORD

nonn

AUTHOR

Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Oct 26 2001

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 December 3 16:57 EST 2008. Contains 151279 sequences.


AT&T Labs Research