%I A006276 M1298
%S A006276 2,4,17,19,5777,5779,192900153617,192900153619,
%T A006276 7177905237579946589743592924684177,7177905237579946589743592924684179,
%U A006276 369822356418414944143680173221426891716916679027557977938929258031490127514207143830378340325399155217
%N A006276 A predictable Pierce expansion.
%D A006276 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A006276 J. O. Shallit, Some predictable Pierce expansions, Fib. Quart., 22 (1984), 
               332-335.
%H A006276 J. O. Shallit, <a href="http://www.cs.uwaterloo.ca/~shallit/Papers/sppe.ps">
               Some predictable Pierce expansions</a>, Fib. Quart., 22 (1984), 332-335.
%H A006276 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               PierceExpansion.html">Pierce Expansion</a>
%F A006276 Let c(0)=3, c(n+1) = c(n)^3-3*c(n) [A001999]; then this sequence is c(0)-1, 
               c(0)+1, c(1)-1, c(1)+1, c(2)-1, c(2)+1, ......
%F A006276 a(n) = 2*F(2*3^floor(n/2)+1)-F(2*3^floor(n/2))-(-1)^n where F(k) denotes 
               the k-th Fibonacci number A000045(k)
%F A006276 Let u(0)=(1+sqrt(5))/2 and u(n+1)=u(n)/frac(u(n)) where frac(x) is the 
               fractional part of x, then a(n)=floor(u(n)). - Benoit Cloitre (benoit7848c(AT)orange.fr), 
               Mar 09 2004
%o A006276 (PARI) r=(1+sqrt(5))/2;for(n=1,10,r=r/(r-floor(r));print1(floor(r),",
               "))
%Y A006276 Sequence in context: A105510 A155951 A118242 this_sequence A103051 A095018 
               A081356
%Y A006276 Adjacent sequences: A006273 A006274 A006275 this_sequence A006277 A006278 
               A006279
%K A006276 nonn,easy
%O A006276 0,1
%A A006276 N. J. A. Sloane (njas(AT)research.att.com).
%E A006276 More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 19 2000