cp's OEIS Frontend

A096274 Indices of zeros in A096535.

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