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.

Showing 1-6 of 6 results.

A014551 Jacobsthal-Lucas numbers.

Original entry on oeis.org

2, 1, 5, 7, 17, 31, 65, 127, 257, 511, 1025, 2047, 4097, 8191, 16385, 32767, 65537, 131071, 262145, 524287, 1048577, 2097151, 4194305, 8388607, 16777217, 33554431, 67108865, 134217727, 268435457, 536870911, 1073741825, 2147483647, 4294967297, 8589934591
Offset: 0

Views

Author

Eric W. Weisstein

Keywords

Comments

Also gives the number of points of period n in the subshift of finite type corresponding to the square matrix A=[1,2;1,0] (this is then given by trace(A^n)). - Thomas Ward, Mar 07 2001
Sequence is identical to its signed inverse binomial transform (autosequence of the second kind). - Paul Curtz, Jul 11 2008
a(n) can be expressed in terms of values of the Fibonacci polynomials F_n(x), computed at x=1/sqrt(2). - Tewodros Amdeberhan (tewodros(AT)math.mit.edu), Dec 15 2008
Pisano period lengths: 1, 1, 2, 2, 4, 2, 6, 2, 6, 4, 10, 2, 12, 6, 4, 2, 8, 6, 18, 4, ... - R. J. Mathar, Aug 10 2012
Let F(x) = Product_{n >= 0} (1 - x^(3*n+1))/(1 - x^(3*n+2)). This sequence is the simple continued fraction expansion of the real number 1 + F(-1/2) = 2.83717 78068 73232 99799 ... = 2 + 1/(1 + 1/(5 + 1/(7 + 1/(17 + ...)))). See A111317. - Peter Bala, Dec 26 2012
With different signs, 2, -1, 5, -7, 17, -31, 65, -127, 257, -511, 1025, -2047, ... is the Lucas V(-1,-2) sequence. - R. J. Mathar, Jan 08 2013
The identity 2 = 2/2 + 2^2/(2*1) - 2^3/(2*1*5) - 2^4/(2*1*5*7) + 2^5/(2*1*5*7*17) + 2^6/(2*1*5*7*17*31) - - + + can be viewed as a generalized Engel-type expansion of the number 2 to the base 2. Compare with A062510. - Peter Bala, Nov 13 2013
For n >= 2, a(n) is the number of ways to tile a 2 X n strip, where the first two columns have an extra cell at the top, with 1 X 2 dominoes and 2 X 2 squares. Shown here is one of the a(7)=127 ways for the n=7 case:
._.
|_|_________.
| | | |_| |
||__|_|_|_|. - Greg Dresden, Sep 26 2021
Named by Horadam (1988) after the German mathematician Ernst Jacobsthal (1882-1965) and the French mathematician Édouard Lucas (1842-1891). - Amiram Eldar, Oct 02 2023

References

  • G. Everest, A. van der Poorten, I. Shparlinski and T. Ward, Recurrence Sequences, Amer. Math. Soc., 2003; see esp. pp. 180, 255.
  • Lind and Marcus, An Introduction to Symbolic Dynamics and Coding, Cambridge University Press, 1995. (General material on subshifts of finite type)
  • Kritkhajohn Onphaeng and Prapanpong Pongsriiam. Jacobsthal and Jacobsthal-Lucas Numbers and Sums Introduced by Jacobsthal and Tverberg. Journal of Integer Sequences, Vol. 20 (2017), Article 17.3.6.
  • Abdelmoumène Zekiri, Farid Bencherif, Rachid Boumahdi, Generalization of an Identity of Apostol, J. Int. Seq., Vol. 21 (2018), Article 18.5.1.

Links

Crossrefs

Cf. A001045 (companion "autosequence"), A019322, A066845, A111317.
Cf. A135440 (first differences), A166920 (partial sums).
Cf. A000079, A033999, A102345, A105723.
Cf. A006995.

Programs

Formula

a(n+1) = 2 * a(n) - (-1)^n * 3.
From Len Smiley, Dec 07 2001: (Start)
a(n) = 2^n + (-1)^n.
G.f.: (2-x)/(1-x-2*x^2). (End)
E.g.f.: exp(x) + exp(-2*x) produces a signed version. - Paul Barry, Apr 27 2003
a(n+1) = Sum_{k=0..floor(n/2)} binomial(n-1, 2*k)*3^(2*k)/2^(n-2). - Paul Barry, Feb 21 2003
0, 1, 5, 7 ... is 2^n - 2*0^n + (-1)^n, the 2nd inverse binomial transform of (2^n-1)^2 (A060867). - Paul Barry, Sep 05 2003
a(n) = 2*T(n, i/(2*sqrt(2))) * (-i*sqrt(2))^n with i^2=-1. - Paul Barry, Nov 17 2003
a(n) = A078008(n) + A001045(n+1). - Paul Barry, Feb 12 2004
a(n) = 2*A001045(n+1) - A001045(n). - Paul Barry, Mar 22 2004
a(0)=2, a(1)=1, a(n) = a(n-1) + 2*a(n-2) for n > 1. - Philippe Deléham, Nov 07 2006
a(2*n+1) = Product_{d|(2*n+1)} cyclotomic(d,2). a(2^k*(2*n+1)) = Product_{d|(2*n+1)} cyclotomic(2*d,2^(2^k)). - Miklos Kristof, Mar 12 2007
a(n) = 2^{(n-1)/2}F_{n-1}(1/sqrt(2)) + 2^{(n+2)/2}F_{n-2}(1/sqrt(2)). - Tewodros Amdeberhan (tewodros(AT)math.mit.edu), Dec 15 2008
E.g.f.: U(0) where U(k) = 1 + (-1)^k/(2^k - 4^k*x*2/(2*x*2^k + (-1)^k*(k+1)/U(k+1))) ; (continued fraction, 3rd kind, 3-step). - Sergei N. Gladkovskii, Nov 02 2012
G.f.: U(0) where U(k) = 1 + (-1)^k/(2^k - 4^k*x*2/(2*x*2^k + (-1)^k/U(k+1))) ; (continued fraction, 3rd kind, 3-step). - Sergei N. Gladkovskii, Nov 02 2012
a(n) = sqrt(9*(A001045)^2 + (-1)^n*2^(n+2)). - Vladimir Shevelev, Mar 13 2013
G.f.: 2 + G(0)*x*(1+4*x)/(2-x), where G(k) = 1 + 1/(1 - x*(9*k-1)/( x*(9*k+8) - 2/G(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Aug 13 2013
a(n) = [x^n] ( (1 + x + sqrt(1 + 2*x + 9*x^2))/2 )^n for n >= 1. - Peter Bala, Jun 23 2015
For n >= 1: a(n) = A006995(2^((n+2)/2)) when n is even, a(n) = A006995(3*2^((n-1)/2) - 1) when n is odd. - Bob Selcoe, Sep 04 2017
a(n) = J(n) + 4*J(n-1), a(0)=2, where J is A001045. - Yuchun Ji, Apr 23 2019
For n >= 0, 1/(2*a(n+1)) = Sum_{m>=n} a(m)/(a(m+1)*a(m+2)). - Kai Wang, Mar 03 2020
For 4 > h >= 0, k >= 0, a(4*k+h) mod 5 = a(h) mod 5. - Kai Wang, May 06 2020
From Kai Wang, May 30 2020: (Start)
(2 - a(n+1)/a(n))/9 = Sum_{m>=n} (-2)^m/(a(m)*a(m+1)).
a(n) = 2*A001045(n+1) - A001045(n).
a(n)^2 = a(2*n) + 2*(-2)^n.
a(n)^2 = 9*A001045(n)^2 + 4*(-2)^n.
a(2*n) = 9*A001045(n)^2 + 2*(-2)^n.
2*A001045(m+n) = A001045(m)*a(n) + a(m)*A001045(n).
2*(-2)^n*A001045(m-n) = A001045(m)*a(n) - a(m)*A001045(n).
A001045(m+n) + (-2)^n*A001045(m-n) = A001045(m)*a(n).
A001045(m+n) - (-2)^n*A001045(m-n) = a(m)*A001045(n).
2*a(m+n) = 9*A001045(m)*A001045(n) + a(m)*a(n).
2*(-2)^n*a(m-n) = a(m)*a(n) - 9*A001045(m)*A001045(n).
a(m+n) - (-2)^n*a(m-n) = 9*A001045(m)*A001045(n).
a(m+n) + (-2)^n*a(m-n) = a(m)*a(n).
a(m+n)*a(m-n) - a(m)*a(m) = 9*(-2)^(m-n)*A001045(n)^2.
a(m+1)*a(n) - a(m)*a(n+1) = 9*(-2)^n*A001045(m-n). (End)
a(n) = F(n+1) + F(n-1) + Sum_{k=0..(n-2)} a(k)*F(n-1-k) for F(n) the Fibonacci numbers and for n > 1. - Greg Dresden, Jun 03 2020

A062510 a(n) = 2^n + (-1)^(n+1).

Original entry on oeis.org

0, 3, 3, 9, 15, 33, 63, 129, 255, 513, 1023, 2049, 4095, 8193, 16383, 32769, 65535, 131073, 262143, 524289, 1048575, 2097153, 4194303, 8388609, 16777215, 33554433, 67108863, 134217729, 268435455, 536870913, 1073741823, 2147483649
Offset: 0

Views

Author

Jason Earls, Jun 24 2001

Keywords

Comments

The identity 2 = 2^2/3 + 2^3/(3*3) - 2^4/(3*3*9) - 2^5/(3*3*9*15) + + - - can be viewed as a generalized Engel-type expansion of the number 2 to the base 2. Compare with A014551. - Peter Bala, Nov 13 2013

References

  • D. M. Burton, Elementary Number Theory, Allyn and Bacon, Inc. Boston, MA, 1976, p. 29.

Links

Crossrefs

Cf. A102345, A105723.

Programs

  • Magma
    [2^n + (-1)^(n+1): n in [0..40]]; // Vincenzo Librandi, Aug 14 2011
  • Mathematica
    LinearRecurrence[{1,2},{0,3}, 30] (* or *) Table[2^n - (-1)^n, {n,0,30}] (* G. C. Greubel, Jan 15 2018 *)
  • PARI
    for(n=0,22,print(2^n+(-1)^(n+1)))

Formula

a(n) = 3*A001045(n). - Paul Curtz, Jan 17 2008
G.f.: 3*x / ( (1+x)*(1-2*x) )
G.f.: Q(0) where Q(k)= 1 - 1/(4^k - 2*x*16^k/(2*x*4^k - 1/(1 + 1/(2*4^k - 8*x*16^k/(4*x*4^k + 1/Q(k+1) ))))); (continued fraction). - Sergei N. Gladkovskii, Apr 13 2013
E.g.f.: (exp(3*x) - 1)*exp(-x). - Ilya Gutkovskiy, Nov 20 2016

Extensions

More terms from Larry Reeves (larryr(AT)acm.org), Jul 06 2001

A105723 a(n) = 3^n - (-1)^n.

Original entry on oeis.org

0, 4, 8, 28, 80, 244, 728, 2188, 6560, 19684, 59048, 177148, 531440, 1594324, 4782968, 14348908, 43046720, 129140164, 387420488, 1162261468, 3486784400, 10460353204, 31381059608, 94143178828, 282429536480, 847288609444, 2541865828328, 7625597484988
Offset: 0

Views

Author

Reinhard Zumkeller, Apr 18 2005

Keywords

Links

Crossrefs

Cf. A000244, A102345.
Cf. A007814, A085058.

Programs

Formula

a(n) = A102345(n) - 2*(-1)^n; (a(n) + A102345(n))/2 = A000244(n);
A007814(a(n)) = A085058(n-1) for n > 0.
E.g.f.: exp(3*x) - exp(-x). - G. C. Greubel, Nov 21 2018
G.f.: 4*x/((1+x)*(1-3*x)). - R. J. Mathar, Mar 08 2021
a(n) = 4*A015518(n). - R. J. Mathar, Mar 08 2021

Extensions

Corrected by T. D. Noe, Dec 11 2006

A201455 a(n) = 3*a(n-1) + 4*a(n-2) for n>1, a(0)=2, a(1)=3.

Original entry on oeis.org

2, 3, 17, 63, 257, 1023, 4097, 16383, 65537, 262143, 1048577, 4194303, 16777217, 67108863, 268435457, 1073741823, 4294967297, 17179869183, 68719476737, 274877906943, 1099511627777, 4398046511103, 17592186044417, 70368744177663, 281474976710657
Offset: 0

Views

Author

Bruno Berselli, Jan 09 2013

Keywords

Comments

This is the Lucas sequence V(3,-4).
Inverse binomial transform of this sequence is A087451.

Links

Crossrefs

Cf. for the same recurrence with initial values (i,i+1): A015521 (Lucas sequence U(3,-4); i=0), A122117 (i=1), A189738 (i=3).
Cf. for similar closed form: A014551 (2^n+(-1)^n), A102345 (3^n+(-1)^n), A087404 (5^n+(-1)^n).
Cf. A052539, A024036.

Programs

  • Magma
    [n le 1 select n+2 else 3*Self(n)+4*Self(n-1): n in [0..25]];
  • Mathematica
    RecurrenceTable[{a[n] == 3 a[n - 1] + 4 a[n - 2], a[0] == 2, a[1] == 3}, a[n], {n, 25}]
  • Maxima
    a[0]:2$ a[1]:3$ a[n]:=3*a[n-1]+4*a[n-2]$ makelist(a[n], n, 0, 25);
  • PARI
    Vec((2-3*x)/((1+x)*(1-4*x)) + O(x^30)) \\ Michel Marcus, Jun 26 2015

Formula

G.f.: (2-3*x)/((1+x)*(1-4*x)).
a(n) = 4^n+(-1)^n.
a(n) = A086341(A047524(n)) for n>0, a(0)=2.
a(n) = [x^n] ( (1 + 3*x + sqrt(1 + 6*x + 25*x^2))/2 )^n for n >= 1. - Peter Bala, Jun 23 2015
a(n) = (2/4^n) * Sum_{k = 0..n} binomial(4*n+1, 4*k). - Peter Bala, Feb 06 2019

A084182 a(n) = 3^n + (-1)^n - [1/(n+1)], where [] represents the floor function.

Original entry on oeis.org

1, 2, 10, 26, 82, 242, 730, 2186, 6562, 19682, 59050, 177146, 531442, 1594322, 4782970, 14348906, 43046722, 129140162, 387420490, 1162261466, 3486784402, 10460353202, 31381059610, 94143178826, 282429536482, 847288609442, 2541865828330, 7625597484986
Offset: 0

Views

Author

Paul Barry, May 19 2003

Keywords

Comments

Binomial transform of A084181.
From Peter Bala, Dec 26 2012: (Start)
Let F(x) = product {n >= 0} (1 - x^(3*n+1))/(1 - x^(3*n+2)). This sequence is the simple continued fraction expansion of the real number F(-1/3) = 1.47627 73316 74531 44215 ... = 1 + 1/(2 + 1/(10 + 1/(26 + 1/(82 + ...)))). See A111317.
(End)

Links

Crossrefs

Except for leading term, same as A102345.
Cf. A046717, A111317.

Programs

  • Mathematica
    LinearRecurrence[{2,3},{1,2,10},30] (* Harvey P. Dale, Apr 27 2016 *)

Formula

a(n) = 3^n + (-1)^n - 0^n.
G.f.: (1+3*x^2)/((1+x)*(1-3*x)).
E.g.f.: exp(3*x)-exp(0)+exp(-x).
a(n) = 2 * A046717(n) for n >= 1.

A274074 a(n) = 6^n+(-1)^n.

Original entry on oeis.org

2, 5, 37, 215, 1297, 7775, 46657, 279935, 1679617, 10077695, 60466177, 362797055, 2176782337, 13060694015, 78364164097, 470184984575, 2821109907457, 16926659444735, 101559956668417, 609359740010495, 3656158440062977, 21936950640377855, 131621703842267137
Offset: 0

Views

Author

Colin Barker, Jun 09 2016

Keywords

Links

Crossrefs

Sequences of the type k^n+(-1)^n: A014551 (k=2), A102345 (k=3), A201455 (k=4), A087404 (k=5), this sequence (k=6).

Programs

  • Mathematica
    Array[6^# + (-1)^# &, 23, 0] (* or *)
LinearRecurrence[{5, 6}, {2, 5}, 23] (* or *)
CoefficientList[ Series[(5x -2)/(6x^2 + 5x -1), {x, 0, 23}], x] (* Robert G. Wilson v, Jan 01 2017 *)
  • PARI
    Vec((2-5*x)/((1+x)*(1-6*x)) + O(x^30))

Formula

O.g.f.: (2-5*x) / ((1+x)*(1-6*x)).
E.g.f.: exp(-x) + exp(6*x).
a(n) = 5*a(n-1)+6*a(n-2) for n>1.
Showing 1-6 of 6 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.