|
|
|
|
0, 1, 4, 7, 24, 41, 140, 239, 816, 1393, 4756, 8119, 27720, 47321, 161564, 275807, 941664, 1607521, 5488420, 9369319, 31988856, 54608393, 186444716, 318281039, 1086679440, 1855077841, 6333631924, 10812186007, 36915112104, 63018038201, 215157040700
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Also, numerators of the lower principal and intermediate convergents to 2^(1/2). The lower principal and intermediate convergents to 2^(1/2), beginning with 1/1, 4/3, 7/5, 24/17, 41/29, form a strictly increasing sequence; essentially, numerators=A143608 and denominators=A079496.
Sequence a(n) such that a(2*n) = sqrt(2*A001108(2*n)) and a(2*n+1) = sqrt(A001108(2*n+1)).
For n > 0, a(n) divides A******(k+1,n+1)-A******(k,n+1) where A****** is any one of A182431, A182439, A182440, A182441 and k is any nonnegative integer.
If p is a prime of the form 8*r +/- 3 then a(p+1) == 0 (mod p); if p is a prime of the form 8*r +/- 1 then a(p-1) == 0 (mod p).
Numbers n such that sqrt(floor(n^2/2 + 1)) is an integer. The integer square roots are given by A079496. - Richard R. Forberg, Aug 01 2013
Define a binary operation o on the real numbers by x o y = x*sqrt(1 + y^2) + y*sqrt(1 + x^2). The operation o is commutative and associative with identity 0. Then we have
a(2*n + 1) = 1 o 1 o ... o 1 (2*n + 1 terms) and
a(2*n) = sqrt(2)*(1 o 1 o ... o 1) (2*n terms). Cf. A084068.
This is a fourth-order divisibility sequence. Indeed, a(2*n) = sqrt(2)*U(2*n) and a(2*n+1) = U(2*n+1), where U(n) is the Lehmer sequence [Lehmer, 1930] defined by the recurrence U(n) = 2*sqrt(2)*U(n-1) - U(n-2) with U(0) = 0 and U(1) = 1. The solution to the recurrence is U(n) = (1/2)*( (sqrt(2) + 1)^n - (sqrt(2) - 1)^n ). (End)
|
|
REFERENCES
|
Serge Lang, Introduction to Diophantine Approximations, Addison-Wesley, New York, 1966.
|
|
LINKS
|
|
|
FORMULA
|
a(2*n) = (a(2*n - 1) + a(2*n + 1))/2.
a(2*n + 1) = (a(2*n) + a(2*n + 2))/4.
a(n) = 6*a(n-2) - a(n-4).
G.f.: x*(1 + 4*x + x^2)/((1 + 2*x - x^2)*(1 - 2*x - x^2)) = x*(1 + 4*x + x^2)/(1 - 6*x^2 + x^4). (End)
a(n) = (((-2 - sqrt(2) + (-1)^n * (-2+sqrt(2))) * ((-1+sqrt(2))^n - (1+sqrt(2))^n)))/(4*sqrt(2)). - Colin Barker, Mar 27 2016
|
|
MAPLE
|
option remember;
if n <= 3 then
op(n+1, [0, 1, 4, 7]) ;
else
6*procname(n-2)-procname(n-4) ;
end if;
|
|
MATHEMATICA
|
a = -4; b = -1; Reap[While[b<2000000000, t = 4*b-a; Sow[t]; a=b; b=t; t = 2*b-a; Sow[t]; a=b; b=t]][[2, 1]]
CoefficientList[Series[x*(1 + 4*x + x^2)/(1 - 6*x^2 + x^4), {x, 0, 30}], x] (* Wesley Ivan Hurt, Aug 24 2014 *)
|
|
PROG
|
(PARI) a(n)=([0, 1, 0, 0; 0, 0, 1, 0; 0, 0, 0, 1; -1, 0, 6, 0]^n*[0; 1; 4; 7])[1, 1] \\ Charles R Greathouse IV, Jun 11 2015
(PARI) concat(0, Vec(x*(1+4*x+x^2)/((1+2*x-x^2)*(1-2*x-x^2)) + O(x^50))) \\ Colin Barker, Mar 27 2016
(Magma) I:=[0, 1, 4, 7]; [n le 4 select I[n] else 6*Self(n-2) - Self(n-4): n in [1..30]]; // G. C. Greubel, Mar 27 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|