login
This site is supported by donations to The OEIS Foundation.

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A200046 Numbers n such that the equation x^n + (x+1)^n = (x+2)^n (mod n), x = 0..n-1 has no solution. 2
15, 25, 33, 35, 39, 55, 57, 69, 75, 95, 99, 115, 117, 119, 121, 123, 125, 129, 135, 143, 145, 153, 155, 169, 175, 195, 203, 205, 209, 215, 217, 221, 225, 235, 247, 253, 255, 259, 273, 275, 285, 289, 295, 299, 305, 309, 315, 319, 321, 323, 325, 333, 335, 339 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

All numbers are composites.

LINKS

Table of n, a(n) for n=1..54.

MAPLE

for n from 1 to 340 do:ii:=0:for x from 0 to n-1 do:if x^n+(x+1)^n -(x+2)^n mod n =0 then ii:=ii+1:else fi:od: if ii=0 then printf(`%d, `, n):else fi:od:

CROSSREFS

Cf. A195637, A200219.

Sequence in context: A102802 A050692 A050693 * A171133 A152246 A069823

Adjacent sequences:  A200043 A200044 A200045 * A200047 A200048 A200049

KEYWORD

nonn

AUTHOR

Michel Lagneau, Nov 14 2011

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified April 19 11:02 EDT 2014. Contains 240748 sequences.