Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096275
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A096275
%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,256,
%T A096275 512,92,604,696,459,255,714,969,594,407,1001,112,1113,1225,817,442,1259,
%U A096275 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.
%Y A096275 Sequence in context: A023440 A077373 A132634 this_sequence A093089 A093091 
               A105471
%Y A096275 Adjacent sequences: A096272 A096273 A096274 this_sequence A096276 A096277 
               A096278
%K A096275 easy,nonn
%O A096275 0,3
%A A096275 N. Fernandez (primeness(AT)borve.org), Jun 23 2004

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research