The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A329006 a(n) = p(1,n), where p(x,n) is the strong divisibility sequence of polynomials based on sqrt(2) as in A327320. 3

%I

%S 1,5,7,85,341,455,5461,21845,9709,349525,1398101,1864135,22369621,

%T 89478485,119304647,1431655765,5726623061,2545165805,91625968981,

%U 366503875925,488671834567,5864062014805,23456248059221,31274997412295,375299968947541,15011998757901653

%N a(n) = p(1,n), where p(x,n) is the strong divisibility sequence of polynomials based on sqrt(2) as in A327320.

%C a(n) is a strong divisibility sequence; i.e., gcd(a(h),a(k)) = a(gcd(h,k)).

%e See Example in A327320.

%t 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];

%t r = Sqrt; f[x_, n_] := c[Factor[Expand[(r x + r)^n - (r x - 1/r)^n]]];

%t Flatten[Table[CoefficientList[f[x, n], x], {n, 1, 12}]]; (* A327320 *)

%t Table[f[x, n] /. x -> 0, {n, 1, 30}] (* A329005 *)

%t Table[f[x, n] /. x -> 1, {n, 1, 30}] (* A329006 *)

%t Table[f[x, n] /. x -> 2, {n, 1, 30}] (* A329007 *)

%t (* _Peter J. C. Moses_, Nov 01 2019 *)

%Y Cf. A327320, A329005, A329007.

%K nonn

%O 1,2

%A _Clark Kimberling_, Nov 08 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 5 03:48 EST 2023. Contains 360082 sequences. (Running on oeis4.)