cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A215569 a(n) = 3*a(n-1) + 46*a(n-2) + a(n-3) with a(0)=0, a(1)=14, a(2)=49.

Original entry on oeis.org

0, 14, 49, 791, 4641, 50358, 365351, 3417162, 27107990, 238878773, 1967021021, 16916594611, 141471629572, 1204545261843, 10138247340452, 85965295695706, 725459810009753, 6140921279372187, 51879880394260905, 438847479843913070, 3709157858947113027
Offset: 0

Views

Author

Roman Witula, Aug 16 2012

Keywords

Comments

The Ramanujan-type sequence number 7 for the argument 2Pi/7 (see also A214683, A215112, A006053, A006054, A215076, A215100, A120757, A215560 for the numbers: 1, 1a, 2, 2a, 3-6 respectively). The sequence a(n) is one of the three special sequences (the remaining two are A215560 and A215572) connected with the following recurrence relation:
(c(1)^4/c(2))^(n/3) + (c(2)^4/c(4))^(n/3) + (c(4)^4/c(1))^(n/3) = at(n) + bt(n)*7^(1/3) + ct(n)*49^(1/3), where c(j):=2*cos(2*Pi*j/7), and the sequences at(n), bt(n), and ct(n) satisfy the following system of recurrence equations: at(n)=7*bt(n-2)+at(n-3),
bt(n)=7*ct(n-2)+bt(n-3), ct(n)=at(n-2)+ct(n-3), with at(0)=3, at(1)=at(2)=bt(0)=bt(1)=bt(2)=ct(0)=ct(1)=0, ct(2)=2 - for details see the Witula's first paper (see also A215560). It follows that a(n)=bt(3*n+1), at(3*n+1)=ct(3*n+1)=0, which implies the first formula below.
We note that all numbers a(n) are divided by 7.

Examples

			We have  (c(1)^4/c(2))^(4/3) + (c(2)^4/c(4))^(4/3) + (c(4)^4/c(1))^(4/3) = (2/7)*(c(1)^4/c(2))^(7/3) + (c(2)^4/c(4))^(7/3) + (c(4)^4/c(1))^(7/3)).
		

References

  • R. Witula, E. Hetmaniok, D. Slota, Sums of the powers of any order roots taken from the roots of a given polynomial, Proceedings of the Fifteenth International Conference on Fibonacci Numbers and Their Applications, Eger, Hungary, 2012.

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{3,46,1},{0,14,49},30] (* Harvey P. Dale, Jan 12 2015 *)

Formula

7^(1/3)*a(n) = (c(1)^4/c(2))^(n+1/3) + (c(2)^4/c(4))^(n+1/3) + (c(4)^4/c(1))^(n+1/3) = (c(1)*(c(1)/c(2))^(1/3))^(3*n+1) + (c(2)*(c(2)/c(4))^(1/3))^(3*n+1) + (c(4)*(c(4)/c(1))^(1/3))^(3*n+1).
G.f.: (14*x+7*x^2)/(1-3*x-46*x^2-x^3).

Extensions

More terms from Harvey P. Dale, Jan 12 2015