Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000283
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A000283
%S A000283 0,1,1,2,5,29,866,750797,563696885165,317754178345286893212434,
%T A000283 100967717855888389973004846476977145423449281581
%N A000283 a(n) = a(n-1)^2 + a(n-2)^2.
%F A000283 a(0)=0 for n>=1 a(n)=floor(A^(2^(n-1))) where A=1.23539273778543688962233101322844082434745718691367945473360\
               1897236639743839118542826528455451978134... - Benoit Cloitre (benoit7848c(AT)orange.fr), 
               May 03 2003
%p A000283 A000283 := proc(n) option remember; if n <= 1 then n else A000283(n-2)^2+A000283(n-1)^2; 
               fi; end;
%o A000283 (PARI) a(n)=if(n<2,n>0,a(n-1)^2+a(n-2)^2)
%Y A000283 Cf. A000278.
%Y A000283 Sequence in context: A064098 A098717 A059784 this_sequence A121910 A073833 
               A086383
%Y A000283 Adjacent sequences: A000280 A000281 A000282 this_sequence A000284 A000285 
               A000286
%K A000283 nonn,easy
%O A000283 0,4
%A A000283 greenfie(AT)math.rutgers.edu (Stephen J. Greenfield)

    
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 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research