cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A096275 a(0) = 0, a(1) = 1; a(n) = (a(n-1) + a(n-2)) mod n^2.

This page as a plain text file.
%I A096275 #3 Mar 31 2012 14:39:53
%S A096275 0,1,2,3,5,8,13,21,34,55,89,0,89,89,178,11,189,200,28,228,256,0,256,
%T A096275 256,512,92,604,696,459,255,714,969,594,407,1001,112,1113,1225,817,
%U A096275 442,1259,1701,1111,876,1987,747,525,1272,1797,569,2366,231,2597,2828,2400,2092
%N A096275 a(0) = 0, a(1) = 1; a(n) = (a(n-1) + a(n-2)) mod n^2.
%t A096275 a = 0; b = 1; i = 2; Do[c = Mod[a + b, i^2]; If[c == 0, Print[i]]; a = b; b = c; i++, {1000000}]
%Y A096275 Cf. A096535.
%K A096275 easy,nonn
%O A096275 0,3
%A A096275 _Neil Fernandez_, Jun 23 2004