|
%I #20 Mar 20 2015 18:37:08
%S 2,8,13,20,25,595,1044,7932,74247,14693476,16766626,24072338,72643740,
%T 1881945888,3304284638,5163731431,5669949197,16209038688,23714508403,
%U 56796564073,181057353263,323874989643,406930606305,539293061152,1751203649485,2136659012156
%N Indices of zeros in A096535.
%C Suggested by _Leroy Quet_.
%t 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 *)
%o #include <stdio.h> [C program from Peter Pein]
%o main(int argc, char *argv[])
%o { long long a0=1, a1=1, n=1, tmp, nmax;
%o if (argc != 2) { fprintf(stderr,"%s n\ncalculates the indices of the first n zeros in A096535\n", argv[0]);
%o return(1); }
%o nmax=atol(argv[1]);
%o while (nmax-- > 0) {
%o while(a1 != 0) {
%o tmp = (a0 + a1) % ++n; a0 = a1; a1 = tmp; }
%o printf("%lld\n",n++); a1 = a0; a0 = 0; }
%o return 0; }
%o (Haskell)
%o import Data.List (elemIndices)
%o a096274 n = a096274_list !! (n-1)
%o a096274_list = elemIndices 0 a096535_list
%o -- _Reinhard Zumkeller_, Oct 19 2011
%Y Cf. A096535: a(0) = a(1) = 1; a(n) = (a(n-1) + a(n-2)) mod n.
%Y Cf. A132678.
%K nonn
%O 1,1
%A _Jim Nastos_, Jun 24 2004
%E a(13) from _Robert G. Wilson v_, Jun 23 2004
%E a(14) - a(16) from _Robert G. Wilson v_, Aug 30 2006
%E Extended to a(26) by _Zak Seidov_, Peter Pein (petsie(AT)dordos.net) and _Martin Fuller_, Nov 22 2007
| 