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-2 of 2 results.

A103200 a(1)=1, a(2)=2, a(3)=11, a(4)=19; a(n) = a(n-4) + sqrt(60*a(n-2)^2 + 60*a(n-2) + 1) for n >= 5.

Original entry on oeis.org

1, 2, 11, 19, 90, 153, 712, 1208, 5609, 9514, 44163, 74907, 347698, 589745, 2737424, 4643056, 21551697, 36554706, 169676155, 287794595, 1335857546, 2265802057, 10517184216, 17838621864, 82801616185, 140443172858, 651895745267, 1105706761003, 5132364345954
Offset: 1

Views

Author

K. S. Bhanu and M. N. Deshpande, Mar 24 2005

Keywords

Comments

The original version of this question was as follows: Let a(1) = 1, a(2) = 2, a(3) = 11, a(4) = 19; for n = 1..4 let b(n) = sqrt(60 a(n)^2 + 60 a(n) + 1); for n >= 5 let a(n) = a(n-4) + b(n-2), b(n) = sqrt(60 a(n)^2 + 60 a(n) +1). Bhanu and Deshpande ask for a proof that a(n) and b(n) are always integers. The b(n) sequence is A103201.
This sequence is also the interleaving of two sequences c and d that can be extended backwards: c(0) = c(1) = 0, c(n) = sqrt(60 c(n-1)^2 + 60 c(n-1) +1) + c(n-2) giving 0,0,1,11,90,712,5609,... d(0) = 1, d(1) = 0, d(n) = sqrt(60 d(n-1)^2 + 60 d(n-1) +1) + d(n-2) giving 1,0,2,19,153,1208,9514,... and interleaved: 0,1,0,0,1,2,11,19,90,153,712,1208,5609,9514,... lim_{n->infinity} a(n)/a(n-2) = 1/(4 - sqrt(15)), (1/(4-sqrt(15)))^n approaches an integer as n -> infinity. - Gerald McGarvey, Mar 29 2005

References

  • K. S. Bhanu (bhanu_105(AT)yahoo.com) and M. N. Deshpande, An interesting sequence of quadruples and related open problems, Institute of Sciences, Nagpur, India, Preprint, 2005.

Crossrefs

Cf. A103201, A177187 (first differences).

Programs

  • Magma
    I:=[1,2,11,19,90]; [n le 5 select I[n] else Self(n-1)+8*Self(n-2)-8*Self(n-3)-Self(n-4)+Self(n-5): n in [1..30]]; // Vincenzo Librandi, Sep 28 2011
  • Maple
    a[1]:=1: a[2]:=2:a[3]:=11: a[4]:=19: for n from 5 to 31 do a[n]:=a[n-4]+sqrt(60*a[n-2]^2+60*a[n-2]+1) od:seq(a[n],n=1..31); # Emeric Deutsch, Apr 13 2005
  • Mathematica
    RecurrenceTable[{a[1]==1,a[2]==2,a[3]==11,a[4]==19,a[n]==a[n-4]+ Sqrt[60a[n-2]^2+60a[n-2]+1]},a[n],{n,40}] (* or *) LinearRecurrence[ {1,8,-8,-1,1},{1,2,11,19,90},40] (* Harvey P. Dale, Sep 27 2011 *)
    CoefficientList[Series[-x*(1 + x + x^2)/((x - 1)*(x^4 - 8*x^2 + 1)), {x, 0, 40}], x] (* T. D. Noe, Jun 04 2012 *)

Formula

Comments from Pierre CAMI and Gerald McGarvey, Apr 20 2005: (Start)
Sequence satisfies a(0)=0, a(1)=1, a(2)=2, a(3)=11; for n > 3, a(n) = 8*a(n-2) - a(n-4) + 3.
G.f.: -x*(1 + x + x^2) / ( (x - 1)*(x^4 - 8*x^2 + 1) ). Note that the 3 = the sum of the coefficients in the numerator of the g.f., 8 appears in the denominator of the g.f. and 8 = 2*3 + 2. Similar relationships hold for other series defined as nonnegative n such that m*n^2 + m*n + 1 is a square, here m=60. Cf. A001652, A001570, A049629, A105038, A105040, A104240, A077288, A105036, A105037. (End)
a(2n) = (A105426(n)-1)/2, a(2n+1) = (A001090(n+2) - 5*A001090(n+1) - 1)/2. - Ralf Stephan, May 18 2007
a(1)=1, a(2)=2, a(3)=11, a(4)=19, a(5)=90, a(n) = a(n-1) + 8*a(n-2) - 8*a(n-3) - a(n-4) + a(n-5). - Harvey P. Dale, Sep 27 2011

Extensions

More terms from Pierre CAMI and Emeric Deutsch, Apr 13 2005

A199338 y-values in the solution to 15*x^2 - 14 = y^2.

Original entry on oeis.org

1, 11, 19, 89, 151, 701, 1189, 5519, 9361, 43451, 73699, 342089, 580231, 2693261, 4568149, 21203999, 35964961, 166938731, 283151539, 1314305849, 2229247351, 10347508061, 17550827269, 81465758639, 138177370801, 641378561051, 1087868139139, 5049562729769
Offset: 1

Views

Author

Sture Sjöstedt, Nov 08 2011

Keywords

Comments

When are both n+1 and 15*n+1 perfect squares? This problem gives the equation 15*x^2-14=y^2.
Essentially the same as A103201. - R. J. Mathar, Nov 11 2011

Crossrefs

Cf. A199336.

Programs

  • Magma
    m:=29; R:=PowerSeriesRing(Integers(), m); Coefficients(R!(x*(1+x)*(1+10*x+x^2)/(1-8*x^2+x^4))); // Bruno Berselli, Nov 08 2011
  • Mathematica
    LinearRecurrence[{0, 8, 0, -1}, {1, 11, 19, 89}, 50]

Formula

a(n+4) = 8*a(n+2) - a(n) with a(1)=1, a(2)=11, a(3)=19, a(4)=89.
G.f.: x*(1+x)*(1+10*x+x^2)/(1-8*x^2+x^4). - Bruno Berselli, Nov 08 2011
Showing 1-2 of 2 results.