|
|
A329019
|
|
a(n) = p(1,n), where p(x,n) is the strong divisibility sequence of polynomials based on sqrt(3/2) as in A328644.
|
|
4
|
|
|
1, 13, 133, 1261, 2321, 105469, 953317, 8596237, 77431669, 139429433, 6275373061, 56482551853, 508359743893, 4575304803901, 8235602334113, 370603178776909, 3335432903959477, 30018913315504477, 270170288559017029, 486306574381812041, 21883796946693169621
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
a(n) is a strong divisibility sequence; i.e., gcd(a(h),a(k)) = a(gcd(h,k)).
|
|
LINKS
|
|
|
EXAMPLE
|
|
|
MATHEMATICA
|
c[poly_] := If[Head[poly] === Times, Times @@ DeleteCases[(#1 (Boole[MemberQ[#1, x] || MemberQ[#1, y] || MemberQ[#1, z]] &) /@Variables /@ #1 &)[List @@ poly], 0], poly];
r = Sqrt[3/2]; f[x_, n_] := c[Factor[Expand[(r x + r)^n - (r x - 1/r)^n]]];
Flatten[Table[CoefficientList[f[x, n], x], {n, 1, 12}]]; (* A328644 *)
Table[f[x, n] /. x -> 0, {n, 1, 30}] (* A329017 *)
Table[f[x, n] /. x -> 1, {n, 1, 30}] (* A329018 *)
Table[f[x, n] /. x -> 2, {n, 1, 30}] (* A329019 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|