Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051423
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051423 Sum of prime divisors of n is congruent to 2^n (mod n). +0
1
15, 77, 99, 240, 354, 18870, 284481, 302174, 433197, 440973, 453086, 2446619, 5776855, 9961111, 17986255, 19091527, 28997648, 37443680, 40074848, 47602448, 67166528, 129389763, 141963648, 146259296, 152062688, 202038871, 203444576 (list; graph; listen)
OFFSET

0,1

EXAMPLE

E.g. 15 = 3*5, and 2^15 = 3+5 (mod 15)

CROSSREFS

Sequence in context: A049391 A000477 A041430 this_sequence A128272 A081591 A044202

Adjacent sequences: A051420 A051421 A051422 this_sequence A051424 A051425 A051426

KEYWORD

nonn,easy,nice

AUTHOR

Joe K. Crump (joecr(AT)carolina.rr.com)

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 September 7 15:23 EDT 2008. Contains 143483 sequences.


AT&T Labs Research