A096274 Indices of zeros in A096535.

2, 8, 13, 20, 25, 595, 1044, 7932, 74247, 14693476, 16766626, 24072338, 72643740, 1881945888, 3304284638, 5163731431, 5669949197, 16209038688, 23714508403, 56796564073, 181057353263, 323874989643, 406930606305, 539293061152, 1751203649485, 2136659012156

Offset

1,1

Comments

Suggested by Leroy Quet.

Links

Table of n, a(n) for n=1..26.

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

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

Cf. A132678.

Sequence in context: A184519 A156245 A247783 * A305879 A271383 A193666

Adjacent sequences: A096271 A096272 A096273 * A096275 A096276 A096277

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