A083955 -id:A083955 - cp's OEIS frontend

A083948 Integer coefficients of A(x), where 1<=a(n)<=8, such that A(x)^(1/8) consists entirely of integer coefficients.

1, 8, 4, 8, 2, 8, 4, 8, 7, 8, 8, 8, 4, 8, 8, 8, 3, 8, 8, 8, 2, 8, 8, 8, 1, 8, 8, 8, 8, 8, 8, 8, 6, 8, 4, 8, 6, 8, 4, 8, 6, 8, 8, 8, 4, 8, 8, 8, 4, 8, 8, 8, 2, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 8, 8, 8, 6, 8, 8, 8, 8, 8, 4, 8, 6, 8, 4, 8, 8, 8, 8, 8, 6, 8, 8, 8, 7, 8, 4, 8, 8, 8, 4, 8, 3, 8, 4, 8, 4, 8, 4, 8, 3

Offset: 0

Paul D. Hanna, May 09 2003

nonn

More generally the sequence, "integer coefficients of A(x), where 1<=a(n)<=m, such that A(x)^(1/m) consists entirely of integer coefficients", appears to have a unique solution for all m. Are these sequences periodic?

Robert G. Wilson v, Table of n, a(n) for n = 0..3000.

Cf. A083952, A083953, A083954, A083955, A083956, A083947, A083949, A083950.

a[0] = 1; a[n_] := a[n] = Block[{k = 1, s = Sum[a[i]*x^i, {i, 0, n-1}]}, While[ Union[ IntegerQ /@ CoefficientList[ Series[(s+k*x^n)^(1/8), {x, 0, n}], x]] != {True}, k++ ]; k]; Table[ a[n], {n, 0, 104}] (* Robert G. Wilson v *)

More terms from Robert G. Wilson v, Jul 26 2005

A083949 Integer coefficients of A(x), where 1<=a(n)<=9, such that A(x)^(1/9) consists entirely of integer coefficients.

Original entry on oeis.org

1, 9, 9, 3, 9, 9, 3, 9, 9, 1, 9, 9, 6, 9, 9, 6, 9, 9, 9, 9, 9, 6, 9, 9, 6, 9, 9, 9, 9, 9, 3, 9, 9, 3, 9, 9, 2, 9, 9, 6, 9, 9, 6, 9, 9, 7, 9, 9, 9, 9, 9, 9, 9, 9, 5, 9, 9, 9, 9, 9, 9, 9, 9, 3, 9, 9, 6, 9, 9, 6, 9, 9, 5, 9, 9, 9, 9, 9, 9, 9, 9, 3, 9, 9, 9, 9, 9, 9, 9, 9, 1, 9, 9, 6, 9, 9, 6, 9, 9, 7, 9, 9, 6, 9, 9

Offset: 0

Paul D. Hanna, May 09 2003

nonn

More generally, the sequence, "integer coefficients of A(x), where 1<=a(n)<=m, such that A(x)^(1/m) consists entirely of integer coefficients", appears to have a unique solution for all m. Are these sequences periodic?

Robert G. Wilson v, Table of n, a(n) for n = 0..3000.

Cf. A083952, A083953, A083954, A083955, A083956, A083947, A083948, A083950.

a[0] = 1; a[n_] := a[n] = Block[{k = 1, s = Sum[a[i]*x^i, {i, 0, n-1}]}, While[ Union[ IntegerQ /@ CoefficientList[ Series[(s+k*x^n)^(1/9), {x, 0, n}], x]] != {True}, k++ ]; k]; Table[ a[n], {n, 0, 104}] (* Robert G. Wilson v *)

More terms from Robert G. Wilson v, Jul 26 2005

A083947 Integer coefficients of A(x), where 1<=a(n)<=7, such that A(x)^(1/7) consists entirely of integer coefficients.

Original entry on oeis.org

1, 7, 7, 7, 7, 7, 7, 1, 7, 7, 7, 7, 7, 7, 5, 7, 7, 7, 7, 7, 7, 1, 7, 7, 7, 7, 7, 7, 1, 7, 7, 7, 7, 7, 7, 4, 7, 7, 7, 7, 7, 7, 2, 7, 7, 7, 7, 7, 7, 1, 7, 7, 7, 7, 7, 7, 1, 7, 7, 7, 7, 7, 7, 3, 7, 7, 7, 7, 7, 7, 5, 7, 7, 7, 7, 7, 7, 1, 7, 7, 7, 7, 7, 7, 2, 7, 7, 7, 7, 7, 7, 5, 7, 7, 7, 7, 7, 7, 1, 7, 7, 7, 7, 7, 7

Offset: 0

Paul D. Hanna, May 09 2003

nonn

More generally the sequence, "integer coefficients of A(x), where 1<=a(n)<=m, such that A(x)^(1/m) consists entirely of integer coefficients", appears to have a unique solution for all m. Are these sequences periodic?

Robert G. Wilson v, Table of n, a(n) for n = 0..3000.

Cf. A083952, A083953, A083954, A083955, A083956, A083948, A083949, A083950.

a[0] = 1; a[n_] := a[n] = Block[{k = 1, s = Sum[a[i]*x^i, {i, 0, n-1}]}, While[ Union[ IntegerQ /@ CoefficientList[ Series[(s+k*x^n)^(1/7), {x, 0, n}], x]] != {True}, k++ ]; k]; Table[ a[n], {n, 0, 104}] (* Robert G. Wilson v *)

More terms from Robert G. Wilson v, Jul 26 2005

A084067 Integer coefficients of A(x), where 1<=a(n)<=12, such that A(x)^(1/12) consists entirely of integer coefficients.

Original entry on oeis.org

1, 12, 6, 4, 9, 12, 4, 12, 12, 8, 6, 12, 6, 12, 12, 12, 12, 12, 8, 12, 9, 12, 12, 12, 12, 12, 6, 12, 6, 12, 10, 12, 6, 12, 12, 12, 2, 12, 6, 8, 6, 12, 12, 12, 12, 4, 12, 12, 8, 12, 12, 8, 3, 12, 4, 12, 12, 4, 12, 12, 9, 12, 6, 4, 6, 12, 4, 12, 12, 12, 12, 12, 2, 12, 6, 12, 3, 12, 6, 12, 3, 8

Offset: 0

Paul D. Hanna, May 10 2003

nonn

More generally, the sequence: "integer coefficients of A(x), where 1<=a(n)<=m, such that A(x)^(1/m) consists entirely of integer coefficients", appears to have a unique solution for all m>0. Are these sequences ever periodic?

Robert G. Wilson v, Table of n, a(n) for n = 0..3000.

Cf. A083952, A083953, A083954, A083955, A083956, A083947 A083948, A083949, A083950, A084066.

a[0] = 1; a[n_] := a[n] = Block[{k = 1, s = Sum[a[i]*x^i, {i, 0, n-1}]}, While[ Union[ IntegerQ /@ CoefficientList[ Series[(s+k*x^n)^(1/12), {x, 0, n}], x]] != {True}, k++ ]; k]; Table[ a[n], {n, 0, 81}] (* Robert G. Wilson v *)

More terms from Robert G. Wilson v, Jul 26 2005

A084066 Least integer coefficients of A(x), where 1<=a(n)<=11, such that A(x)^(1/11) consists entirely of integer coefficients.

Original entry on oeis.org

1, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 7, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 4, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 9, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 5, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 5, 11, 11, 11, 11, 11

Offset: 0

Paul D. Hanna, May 10 2003

nonn

More generally, the sequence: "integer coefficients of A(x), where 1<=a(n)<=m, such that A(x)^(1/m) consists entirely of integer coefficients", appears to have a unique solution for all m>0. Are these sequences ever periodic?

Robert G. Wilson v, Table of n, a(n) for n = 0..3000.

Cf. A083952, A083953, A083954, A083955, A083956, A083947, A083948, A083949, A083950, A084067.

a[0] = 1; a[n_] := a[n] = Block[{k = 1, s = Sum[a[i]*x^i, {i, 0, n-1}]}, While[ Union[ IntegerQ /@ CoefficientList[ Series[(s+k*x^n)^(1/11), {x, 0, n}], x]] != {True}, k++ ]; k]; Table[ a[n], {n, 0, 71}] (* Robert G. Wilson v *)

a(k)=0 (mod 11) when k not= 0 (mod 11); a(0)=1, a(11)=1, a(22)=7, a(33)=4, a(44)=9, a(55)=5, a(66)=5, ...

More terms from Robert G. Wilson v, Jul 26 2005

A132855 Number of sequences {c(i), i=0..n} that form the initial terms of a self-convolution 5th power of an integer sequence such that 0 < c(n) <= 5*c(n-1) for n>0 with c(0)=1.

Original entry on oeis.org

1, 1, 5, 75, 3625, 638750, 442823125, 1278820631250, 15775429658296875, 848938273203627578125, 202483260558673741179296875, 216741216953142470752123517187500, 1051774892873652266440974611041742187500

Offset: 0

Paul D. Hanna, Sep 19 2007, Oct 06 2007

nonn

The minimal path in the 5-convoluted tree is A083955 and the maximal path is A132839.

Equals the number of nodes at generation n in the 5-convoluted tree, which is defined as follows: tree of all finite sequences {c(k), k=0..n} that form the initial terms of a self-convolution 5th power of some integer sequence such that 0 < c(n) <= 5*c(n-1) for n>0 with a(0)=1.

			a(n) counts the nodes in generation n of the following tree.
Generations 0..3 of the 5-convoluted tree are as follows;
The path from the root is shown, with child nodes enclosed in [].
GEN.0: [1];
GEN.1: 1->[5];
GEN.2: 1-5->[5,10,15,20,25];
GEN.3:
1-5-5->[5,10,15,20,25]
1-5-10->[5,10,15,20,25,30,35,40,45,50]
1-5-15->[5,10,15,20,25,30,35,40,45,50,55,60,65,70,75]
1-5-20->[5,10,15,20,25,30,35,40,45,50,55,60,65,70,75,80,85,90,95,100]
1-5-25->[5,10,15,20,25,30,35,40,45,50,55,60,65,70,75,80,85,90,95,100,105, 110,115,120,125].
Each path in the tree from the root node forms the initial terms of a self-convolution 5th power of a sequence of integer terms.

Martin Fuller, Computing A132852, A132853, A132854, A132855, A132856

Cf. A132852, A132853, A132854, A132856; A083955, A132839.

Extended by Martin Fuller, Sep 24 2007

cp's OEIS Frontend

A083948 Integer coefficients of A(x), where 1<=a(n)<=8, such that A(x)^(1/8) consists entirely of integer coefficients.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Extensions

A083949 Integer coefficients of A(x), where 1<=a(n)<=9, such that A(x)^(1/9) consists entirely of integer coefficients.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Extensions

A083947 Integer coefficients of A(x), where 1<=a(n)<=7, such that A(x)^(1/7) consists entirely of integer coefficients.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Extensions

A084067 Integer coefficients of A(x), where 1<=a(n)<=12, such that A(x)^(1/12) consists entirely of integer coefficients.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Extensions

A084066 Least integer coefficients of A(x), where 1<=a(n)<=11, such that A(x)^(1/11) consists entirely of integer coefficients.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A132855 Number of sequences {c(i), i=0..n} that form the initial terms of a self-convolution 5th power of an integer sequence such that 0 < c(n) <= 5*c(n-1) for n>0 with c(0)=1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions