OFFSET
10,2
COMMENTS
Thus far (up to n=69) a pattern does not seems to exist, but we found something interesting: for every Poulet number not divisible by 3 checked, we obtained N=0 or N = -((n - s)^2 mod (n + s)).
Poulet numbers which give N=0: 341, 1105, 1729, 2047, 2465, 2701, 2821, 3277, 4033, 4369, 4681, 5461, 6601, 7957, 8321, 8911, 10261, 10585, 13741, 13747, 13981, 14491, 15709.
Poulet numbers which give N = -((n - s)^2 mod (n + s)): 1387.
We found out something even more: taking randomly a number n >= 10, that is 19, we obtained, taking beside s a number bigger than 0 and less than s, next values for N: 0, 0, 10, 14, 2, 18, 10, 10, 12.
For Poulet numbers checked (all the ones above) we got for N just the value 0 when we took, beside s, a number less than s. Still for Poulet numbers, we obtained a lot of values of 0 even when we took, beside s, a number bigger than s (but for 1105 we obtained, taking beside s the numbers 17, 18, 19, 20, the following values for N: -34, -36, -38, -40).
For n>2999 a(n) = 0, see proof in MoHPC link. - Gerald Hillier, Dec 18 2017
LINKS
MoHPC: The Museum of HP Calculators, Proof of Unproven Conjecture?, December 2017.
E. W. Weisstein, Poulet Number
MATHEMATICA
Table[Mod[(n - s[n])^2, n + s[n]] - Mod[(n + s[n])^2, n - s[n]], {n, 10, 100}] (* T. D. Noe, May 21 2012 *)
PROG
(PARI) a(n)=my(s=sumdigits(n)); (n-s)^2%(n+s) - (n+s)^2%(n-s) \\ Charles R Greathouse IV, Dec 08 2014
CROSSREFS
KEYWORD
sign,base,easy
AUTHOR
Marius Coman, May 21 2012
STATUS
approved