|
| |
|
|
A064457
|
|
a(1) = 3; for n > 1, choose a(n) to be the smallest number such that a(n) > a(n-1) and (a(n)*a(n-1)+1) mod (a(n)+a(n-1)+1) = 0.
|
|
0
| |
|
|
3, 7, 47, 157, 293, 1807, 8697, 9447, 15147, 31497, 74847, 159111, 1031187, 1100457, 1740087, 3589707, 8498937, 10312173, 15086925, 51874335, 54072205, 746239895, 1433920655
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Starting with a(1) = 0, 1 or 2 there are no solutions.
|
|
|
EXAMPLE
| a(3) = 47 because 7*47 + 1 = 330 and 7+47+1 = 55 and 55*6 = 330
|
|
|
CROSSREFS
| Sequence in context: A129518 A007670 A074714 * A005650 A020754 A052381
Adjacent sequences: A064454 A064455 A064456 * A064458 A064459 A064460
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Oct 15 2001
|
|
|
EXTENSIONS
| More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 18 2001
|
| |
|
|
