The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A071557 Numbers n such that A065876(n)=n^2-n+1. 2
 2, 3, 4, 5, 6, 7, 9, 10, 11, 14, 15, 16, 19, 20, 24, 25, 26, 29, 35, 36, 39, 40, 41, 45, 49, 51, 54, 56, 59, 61, 65, 66, 69, 71, 74, 79, 84, 85, 90, 94, 95, 101, 110, 116, 120, 121, 124, 126, 130, 131, 134, 139, 141, 145, 146, 150, 156, 159, 160, 165, 169, 170, 171 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS PROG (PARI) for(n=1, 300, q=n+1; while((q^2+1)%(n^2+1)>0, q++); if(q==n^2-n+1, print1(n, ", "))) CROSSREFS Cf. A065876. Sequence in context: A174328 A272570 A123101 * A331802 A271108 A179401 Adjacent sequences:  A071554 A071555 A071556 * A071558 A071559 A071560 KEYWORD easy,nonn AUTHOR Benoit Cloitre, May 30 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 26 13:49 EDT 2020. Contains 334626 sequences. (Running on oeis4.)