Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005246
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005246 a(n)=(1+a(n-1)a(n-2))/a(n-3).
(Formerly M0829)
+0
10
1, 1, 1, 2, 3, 7, 11, 26, 41, 97, 153, 362, 571, 1351, 2131, 5042, 7953, 18817, 29681, 70226, 110771, 262087, 413403, 978122, 1542841, 3650401, 5757961, 13623482, 21489003, 50843527, 80198051, 189750626, 299303201, 708158977, 1117014753 (list; graph; listen)
OFFSET

0,4

COMMENT

For n >= 4 we have the linear recurrence a(n) = 4*a(n-2) - a(n-4). - Ahmed Fares (ahmedfares(AT)my-deja.com), Jun 04 2001

Integer solutions to the equation floor(sqrt(3)*x^2)=x*floor(sqrt(3)*x) - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 18 2004

For n>2, a(n) is the smallest integer > a(n-1) such that sqrt(3)*a(n) is closer to and greater than an integer than sqrt(3)*a(n-1). i.e. a(n) is the smallest integer > a(n-1) such that frac(sqrt(3)*a(n))<frac(sqrt(3)*a(n-1)). - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 20 2003

The lower principal and intermediate convergents to 3^(1/2), beginning with 1/1, 3/2, 5/3, 12/7, 19/11, form a strictly increasing sequence; essentially, numerators=A143643 and denominators=A005246. - Clark Kimberling (ck6(AT)evansville.edu), Aug 27 2008

REFERENCES

T. Crilly, Double sequences of positive integers, Math. Gaz., 69 (1985), 263-271.

Clark Kimberling, "Best lower and upper approximates to irrational numbers," Elemente der Mathematik, 52 (1997) 122-126.

Serge Lang, Introduction to Diophantine Approximations, Addison-Wesley, New York, 1966.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

T. D. Noe, Table of n, a(n) for n=0..500

Enrica Duchi, Andrea Frosini, Renzo Pinzani and Simone Rinaldi, A Note on Rational Succession Rules, J. Integer Seqs., Vol. 6, 2003.

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

FORMULA

G.f.: (1+x-3*x^2-2*x^3)/(1-4*x^2+x^4).

lim n ->infinity a(2n+1)/a(2n) = (3+sqrt(3))/3 =1.5773502... lim n ->infinity a(2n)/a(2n-1) = (3+sqrt(3))/2 = 2.3660254.... - Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 07 2002

A101265(n) = a(n)*a(n+1). - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Apr 24 2006

a(2-n)=a(n). - Michael Somos Nov 15 2006

For n>2: a(n) = a(n-1) + SUM(a(2*k): 1 <= k < n/2). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 16 2007

MAPLE

A005246:=-(-1-z+2*z**2+z**3)/(1-4*z**2+z**4); [Conjectured by S. Plouffe in his 1992 dissertation. Gives sequence except for one of the leading 1's.]

PROGRAM

(PARI) {a(n)=if(n<0, n=2-n); polcoeff((1+x-3*x^2-2*x^3)/(1-4*x^2+x^4)+x*O(x^n), n)} /* Michael Somos Nov 15 2006 */

CROSSREFS

Bisections are A001835 and A001075.

Cf. A101265.

Sequence in context: A007481 A121268 A101173 this_sequence A116406 A112843 A036651

Adjacent sequences: A005243 A005244 A005245 this_sequence A005247 A005248 A005249

KEYWORD

easy,nonn,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Michael Somos, Aug 01 2001

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 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research