OFFSET
1,1
COMMENTS
Suggested by Leroy Quet.
MATHEMATICA
a = b = 1; lst = {}; Do[c = Mod[a + b, n]; If[c == 0, AppendTo[lst, n]; Print@n]; a = b; b = c, {n, 2, 10^9}] (* Robert G. Wilson v, Dec 17 2007 *)
PROG
#include <stdio.h> [C program from Peter Pein]
main(int argc, char *argv[])
{ long long a0=1, a1=1, n=1, tmp, nmax;
if (argc != 2) { fprintf(stderr, "%s n\ncalculates the indices of the first n zeros in A096535\n", argv[0]);
return(1); }
nmax=atol(argv[1]);
while (nmax-- > 0) {
while(a1 != 0) {
tmp = (a0 + a1) % ++n; a0 = a1; a1 = tmp; }
printf("%lld\n", n++); a1 = a0; a0 = 0; }
return 0; }
(Haskell)
import Data.List (elemIndices)
a096274 n = a096274_list !! (n-1)
a096274_list = elemIndices 0 a096535_list
-- Reinhard Zumkeller, Oct 19 2011
CROSSREFS
KEYWORD
nonn
AUTHOR
Jim Nastos, Jun 24 2004
EXTENSIONS
a(13) from Robert G. Wilson v, Jun 23 2004
a(14) - a(16) from Robert G. Wilson v, Aug 30 2006
Extended to a(26) by Zak Seidov, Peter Pein (petsie(AT)dordos.net) and Martin Fuller, Nov 22 2007
STATUS
approved