|
|
A225786
|
|
Numbers k such that oblong(2*k) + oblong(k) is a square, where oblong(k) = A002378(k) = k*(k+1).
|
|
2
|
|
|
0, 48, 15552, 5007792, 1612493568, 519217921200, 167186558132928, 53833552500881712, 17334236718725778432, 5581570389877199773488, 1797248331303739601284800, 578708381109414274413932208, 186342301468900092621684886272
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Numbers k such that k*(5*k+3) is a perfect square. Apparently a(n) = 323*a(n-1) -323*a(n-2) +a(n-3). - R. J. Mathar, May 18 2013
|
|
LINKS
|
|
|
FORMULA
|
a(n) = (3/20)*((2-sqrt(5))^(4n-4)+(2+sqrt(5))^(4n-4)-2). - Bruno Berselli, May 18 2013
|
|
EXAMPLE
|
48*49 + 96*97 = 108^2, so 48 is in the sequence.
|
|
MATHEMATICA
|
LinearRecurrence[{323, -323, 1}, {0, 48, 15552}, 15] (* Bruno Berselli, May 18 2013 *)
|
|
PROG
|
(C)
#include <stdio.h>
#include <math.h>
int main() {
unsigned long long i, s, t;
for (i = 0; i< (1ULL<<31); i++) {
s = 2*i*(2*i+1) + i*(i+1);
t = sqrt(s);
if (s==t*t) printf("%llu, ", i);
}
return 0;
}
|
|
CROSSREFS
|
Cf. A098301 (numbers n such that oblong(2*n) - oblong(n) is a square).
Cf. A224419 (triangular(2*n) + triangular(n) is a square).
Cf. A220186 (triangular(2*n) - triangular(n) is a square).
Cf. A225785 (oblong(2*n) + oblong(n) is an oblong number).
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|