Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006275
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A006275 M1342
%S A006275 2,5,7,197,199,7761797,7761799,467613464999866416197,
%T A006275 467613464999866416199,
%U A006275 102249460387306384473056172738577521087843948916391508591105797
%N A006275 A predictable Pierce expansion.
%D A006275 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A006275 J. O. Shallit, Some predictable Pierce expansions, Fib. Quart., 22 (1984), 
               332-335.
%H A006275 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 A006275 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               PierceExpansion.html">Pierce Expansion</a>
%F A006275 Let u(0)=1+sqrt(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
%e A006275 Let c(0)=6, c(n+1) = c(n)^3-3*c(n); then this sequence is 2, c(0)-1, 
               c(0)+1, c(1)-1, c(1)+1, c(2)-1, c(2)+1, ...
%o A006275 (PARI) r=1+sqrt(2);for(n=1,10,r=r/(r-floor(r));print1(floor(r),","))
%Y A006275 Sequence in context: A041445 A041961 A058854 this_sequence A042673 A007571 
               A062621
%Y A006275 Adjacent sequences: A006272 A006273 A006274 this_sequence A006276 A006277 
               A006278
%K A006275 nonn,easy
%O A006275 0,1
%A A006275 N. J. A. Sloane (njas(AT)research.att.com).
%E A006275 More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 19 2000

    
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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research