Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117581
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117581 For each successive prime p, the largest integer n such that both n and n-1 factor into primes less than or equal to p. By a theorem of Stormer, the number of such integers is finite; moreover he provides an algorithm for finding the complete list. +0
2
2, 9, 81, 4375, 9801, 123201, 336141, 11859211, 11859211, 177182721, 1611308700, 3463200000, 63927525376, 421138799640, 1109496723126, 1453579866025, 20628591204481, 31887350832897, 31887350832897, 119089041053697 (list; graph; listen)
page 1

Search completed in 0.001 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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research