1,1

Suggested by Leroy Quet

Leroy Quet, Home Page (listed in lieu of email address)

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 (rgwv(AT)rgwv.com), Dec 17 2007 *)

#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; }

Cf. A096535: a(0) = a(1) = 1; a(n) = (a(n-1) + a(n-2)) mod n.

Sequence in context: A030389 A136738 A156245 this_sequence A037382 A095825 A106359

Adjacent sequences: A096271 A096272 A096273 this_sequence A096275 A096276 A096277

nonn

Jim Nastos (nastos(AT)gmail.com), Jun 24 2004

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 (zakseidov(AT)yahoo.com), Peter Pein (petsie(AT)dordos.net) and Martin Fuller (martin_n_fuller(AT)btinternet.com), Nov 22 2007