Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001085
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001085 a(n) = 20a(n-1) - a(n-2).
(Formerly M4744 N2030)
+0
7
1, 10, 199, 3970, 79201, 1580050, 31521799, 628855930, 12545596801, 250283080090, 4993116004999, 99612037019890, 1987247624392801, 39645340450836130, 790919561392329799, 15778745887395759850 (list; graph; listen)
OFFSET

0,2

COMMENT

Chebyshev's polynomials T(n,x) evaluated at x=10.

The a(n) give all (unsigned, integer) solutions of Pell equation a(n)^2 - 99*b(n)^2 = +1 with b(n)=A075843(n), n>=0.

a(11+22k)-1 and a(11+22k)+1 are consecutive odd powerful numbers. The first pair is 99612037019890+-1. See A076445. - T. D. Noe (noe(AT)sspectra.com), May 04 2006

REFERENCES

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

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

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.

H. Brocard, Notes e'le'mentaires sur le proble`me de Peel, Nouvelles Correspondance Math\'{e}matique, 4 (1878), 161-169.

"Questions D'Arithmetique", Question 3686, Solution by H.L. Mennessier, Mathesis, 65(4, Supplement) 1956, pp. 1-12.

LINKS

Index entries for sequences related to linear recurrences with constant coefficients

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.

Tanya Khovanova, Recursive Sequences

Index entries for sequences related to Chebyshev polynomials.

FORMULA

For all members x of the sequence, 11*x^2 - 11 is a square. Lim. n-> Inf. a(n)/a(n-1) = 10 + 3*Sqrt(11) - Gregory V. Richardson (omomom(AT)hotmail.com), Oct 13 2002

a(n) = T(n, 10) = (S(n, 20)-S(n-2, 20))/2, with S(n, x) := U(n, x/2) and T(n), resp. U(n, x), are Chebyshev's polynomials of the first, resp. second, kind. See A053120 and A049310. S(-2, x) := -1, S(-1, x) := 0, S(n-1, 20)= A075843(n).

G.f. (1-10*x)/(1-20*x+x^2).

a(n) = (((10+3*sqrt(11))^n + (10-3*sqrt(11))^n))/2.

a(n) = sqrt(99*A075843(n)^2 + 1), (cf. Richardson comment).

MAPLE

A001085:=-(-1+10*z)/(1-20*z+z**2); [Conjectured by S. Plouffe in his 1992 dissertation.]

PROGRAM

sage: [lucas_number2(n, 20, 1)/2 for n in xrange(0, 20)] - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 27 2008

CROSSREFS

Cf. A090728.

Sequence in context: A126463 A152561 A097127 this_sequence A079436 A126431 A156275

Adjacent sequences: A001082 A001083 A001084 this_sequence A001086 A001087 A001088

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Sep 19 2000

Chebyshev and Pell comments from W. Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de), Nov 08 2002

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research