[go: up one dir, main page]

login
A002310
a(n) = 5*a(n-1) - a(n-2), with a(0) = 1 and a(1) = 2.
5
1, 2, 9, 43, 206, 987, 4729, 22658, 108561, 520147, 2492174, 11940723, 57211441, 274116482, 1313370969, 6292738363, 30150320846, 144458865867, 692144008489, 3316261176578, 15889161874401, 76129548195427, 364758579102734, 1747663347318243
OFFSET
0,2
COMMENTS
Together with A002320 these are the two sequences satisfying ( a(n)^2+a(n-1)^2 )/(1 - a(n)a(n-1)) is an integer, in both cases this integer is -5. - Floor van Lamoen, Oct 26 2001
Limit_{n->infinity} a(n+1)/a(n) = (5 + sqrt(21))/2 = A107905. - Wolfdieter Lang, Nov 17 2023
REFERENCES
From a posting to Netnews group sci.math by ksbrown(AT)seanet.com (K. S. Brown) on Aug 15 1996.
LINKS
Margherita Maria Ferrari and Norma Zagaglia Salvi, Aperiodic Compositions and Classical Integer Sequences, Journal of Integer Sequences, Vol. 20 (2017), Article 17.8.8.
Tanya Khovanova, Recursive Sequences
FORMULA
Sequences A002310, A002320 and A049685 have this in common: each one satisfies a(n+1) = (a(n)^2+5)/a(n-1). - Graeme McRae, Jan 30 2005
G.f.: (1-3x)/(1-5x+x^2). - Philippe Deléham, Nov 16 2008
a(n) = S(n, 5) - 3*S(n-1, 5), for n >= 0, with the S-Chebyshev polynomial (see A049310) S(n, 5) = A004254(n+1). - Wolfdieter Lang, Nov 17 2023
MATHEMATICA
LinearRecurrence[{5, -1}, {1, 2}, 25] (* T. D. Noe, Feb 22 2014 *)
PROG
(Haskell)
a002310 n = a002310_list !! n
a002310_list = 1 : 2 :
(zipWith (-) (map (* 5) (tail a002310_list)) a002310_list)
-- Reinhard Zumkeller, Oct 16 2011
KEYWORD
nonn,easy,changed
AUTHOR
Joe Keane (jgk(AT)jgk.org)
STATUS
approved