Search: id:A002813
Results 1-1 of 1 results found.

%I A002813 M3561 N1443
%S A002813 4,19,5779,192900153619,7177905237579946589743592924684179,
%T A002813 369822356418414944143680173221426891716916679027557977938929258031490127514207143830378340325399155219
%N A002813 a(n) = a(n-1)^3 - 3a(n-1)^2 + 3.
%C A002813 An infinite coprime sequence defined by recursion. - Michael Somos Mar 
               14 2004
%D A002813 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A002813 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A002813 L. E. Dickson, History of the Theory of Numbers. Carnegie Institute Public. 
               256, Washington, DC, Vol. 1, 1919; Vol. 2, 1920; Vol. 3, 1923, see 
               vol. 1, p. 397.
%D A002813 E. Lucas, Nouveaux theoremes d'arithmetique superieure, Comptes Rend., 
               83 (1876), 1286-1288.
%F A002813 a(n)=L(2*3^n)+1 where L=Lucas numbers.
%F A002813 a(n)=L(3^(n+1))/L(3^n) - Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 
               18 2005
%F A002813 a(n) = A001999(n)+1 (Conjecture). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Apr 22 2007
%o A002813 (PARI) a(n)=if(n<1,4*(n==0),a(n-1)^3-3*a(n-1)^2+3)
%o A002813 (PARI) a(n)=if(n<0,0,n=2*3^n;fibonacci(n+1)+fibonacci(n-1)+1)
%Y A002813 Sequence in context: A000863 A058348 A023994 this_sequence A104159 A039921 
               A081852
%Y A002813 Adjacent sequences: A002810 A002811 A002812 this_sequence A002814 A002815 
               A002816
%K A002813 nonn,easy,nice
%O A002813 0,1
%A A002813 N. J. A. Sloane (njas(AT)research.att.com).

Search completed in 0.001 seconds