A083950 -id:A083950 - cp's OEIS frontend

A110641 Every 10th term of A083950.

1, 3, 5, 8, 7, 7, 7, 9, 8, 8, 5, 6, 10, 1, 5, 5, 4, 6, 8, 2, 3, 6, 2, 2, 6, 2, 4, 4, 3, 6, 4, 3, 10, 3, 10, 6, 5, 6, 10, 2, 8, 10, 9, 1, 5, 9, 2, 10, 7, 2, 10, 3, 5, 2, 7, 3, 2, 7, 7, 7, 10, 5, 5, 9, 1, 4, 4, 9, 9, 2, 7, 4, 2, 2, 7, 7, 5, 10, 4, 5, 2, 8, 2, 7, 1, 2, 3, 6, 6, 4, 4, 10, 5, 1, 2, 10, 1, 8, 9, 3

Offset: 0

Robert G. Wilson v and Paul D. Hanna, Aug 30 2005

nonn

Cf. A083950, A110642, A110643.

{a(n)=local(d=10,m=10,A=1+m*x); for(j=2,d*n, for(k=1,m,t=polcoeff((A+k*x^j+x*O(x^j))^(1/m),j); if(denominator(t)==1,A=A+k*x^j;break)));polcoeff(A,d*n)}

A084210 G.f. A(x) defined by: A(x)^10 consists entirely of integer coefficients between 1 and 10 (A083950); A(x) is the unique power series solution with A(0)=1.

Original entry on oeis.org

1, 1, -4, 25, -173, 1292, -10105, 81565, -673691, 5662878, -48263038, 415950272, -3617999891, 31714089336, -279828926113, 2483097203637, -22143011361045, 198317403322755

Offset: 0

Paul D. Hanna, May 20 2003

sign

Limit a(n)/a(n+1) --> r = -0.104430987675729 where A(r)=0.

Cf. A083950, A084202-A084209, A084211, A084212.

kmax = 20;
A[x_] = Sum[a[k] x^k, {k, 0, kmax}];
coes = CoefficientList[A[x]^10 + O[x]^(kmax + 1), x];
r = {a[0] -> 1, a[1] -> 1};
coes = coes /. r;
Do[r = Flatten @ Append[r, Reduce[1 <= coes[[k]] <= 10, a[k - 1], Integers] // ToRules];
coes = coes /. r, {k, 3, kmax + 1}];
Table[a[k], {k, 0, kmax}] /. r (* Jean-François Alcover, Jul 26 2018 *)

A110642 Every 5th term of A083950 where the self-convolution 5th power is congruent modulo 25 to A083950, which consists entirely of numbers 1 through 10.

Original entry on oeis.org

1, 2, 3, 2, 5, 8, 8, 4, 7, 2, 7, 4, 7, 2, 9, 6, 8, 8, 8, 8, 5, 8, 6, 2, 10, 4, 1, 4, 5, 6, 5, 10, 4, 4, 6, 10, 8, 4, 2, 8, 3, 10, 6, 10, 2, 8, 2, 6, 6, 4, 2, 10, 4, 8, 4, 10, 3, 2, 6, 2, 4, 2, 3, 8, 10, 10, 3, 6, 10, 10, 6, 8, 5, 8, 6, 4, 10, 2, 2, 4, 8, 2, 10, 4, 9, 6, 1, 6, 5, 10, 9, 8, 2, 8, 10, 4, 7, 8

Offset: 0

Robert G. Wilson v and Paul D. Hanna, Aug 30 2005

nonn

			A(x) = 1 + 2*x + 3*x^2 + 2*x^3 + 5*x^4 + 8*x^5 + 8*x^6 +...
A(x)^5 = 1 + 10*x + 55*x^2 + 210*x^3 + 635*x^4 + 1652*x^5 +...
A(x)^5 (mod 25) = 1 + 10*x + 5*x^2 + 10*x^3 + 10*x^4 + 2*x^5 +...
G(x) = 1 + 10*x + 5*x^2 + 10*x^3 + 10*x^4 + 2*x^5 + 5*x^6 +...
where G(x) is the g.f. of A083950.

Cf. A083950, A110641, A110643.

{a(n)=local(d=5,m=10,A=1+m*x); for(j=2,d*n, for(k=1,m,t=polcoeff((A+k*x^j+x*O(x^j))^(1/m),j); if(denominator(t)==1,A=A+k*x^j;break)));polcoeff(A,d*n)}

A110643 Every 2nd term of A083950 where the self-convolution 2nd power is congruent modulo 4 to A083950, which consists entirely of numbers 1 through 10.

Original entry on oeis.org

1, 5, 10, 5, 10, 3, 5, 10, 10, 10, 5, 5, 5, 5, 5, 8, 10, 10, 5, 10, 7, 10, 5, 10, 5, 7, 5, 5, 10, 10, 7, 10, 10, 5, 5, 9, 5, 5, 5, 10, 8, 10, 10, 10, 10, 8, 5, 5, 10, 10, 5, 10, 10, 10, 5, 6, 5, 5, 10, 5, 10, 10, 5, 10, 10, 1, 5, 5, 10, 10, 5, 5, 5, 10, 5, 5, 10, 5, 5, 10, 4, 10, 10, 5, 5, 6, 10

Offset: 0

Robert G. Wilson v and Paul D. Hanna, Aug 30 2005

nonn

			A(x) = 1 + 5*x + 10*x^2 + 5*x^3 + 10*x^4 + 3*x^5 + 5*x^6 +...
A(x)^2 = 1 + 10*x + 45*x^2 + 110*x^3 + 170*x^4 + 206*x^5 +...
A(x)^2 (mod 4) = 1 + 2*x + x^2 + 2*x^3 + 2*x^4 + 2*x^5 +...
G(x) = 1 + 10*x + 5*x^2 + 10*x^3 + 10*x^4 + 2*x^5 + 5*x^6 +...
where G(x) is the g.f. of A083950.

Cf. A083950, A110641, A110642.

{a(n)=local(d=2,m=10,A=1+m*x); for(j=2,d*n, for(k=1,m,t=polcoeff((A+k*x^j+x*O(x^j))^(1/m),j); if(denominator(t)==1,A=A+k*x^j;break)));polcoeff(A,d*n)}

A109626 Consider the array T(n,m) where the n-th row is the sequence of integer coefficients of A(x), where 1<=a(n)<=n, such that A(x)^(1/n) consists entirely of integer coefficients and where m is the (m+1)-th coefficient. This is the antidiagonal read from lower left to upper right.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 4, 3, 2, 1, 1, 5, 2, 1, 2, 1, 1, 6, 5, 4, 3, 2, 1, 1, 7, 3, 5, 3, 3, 1, 1, 1, 8, 7, 2, 5, 4, 3, 2, 1, 1, 9, 4, 7, 3, 1, 4, 3, 2, 1, 1, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 11, 5, 3, 2, 7, 6, 5, 1, 3, 1, 1, 1, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 13, 6, 11, 10, 9, 4, 1, 3, 5

Offset: 1

Paul D. Hanna and Robert G. Wilson v, Aug 01 2005

			Table begins:
\k...0...1...2...3...4...5...6...7...8...9..10..11..12..13
n\
 1|  1   1   1   1   1   1   1   1   1   1   1   1   1   1
 2|  1   2   1   2   2   2   1   2   2   2   1   2   1   2
 3|  1   3   3   1   3   3   3   3   3   3   3   3   1   3
 4|  1   4   2   4   3   4   4   4   1   4   4   4   3   4
 5|  1   5   5   5   5   1   5   5   5   5   4   5   5   5
 6|  1   6   3   2   3   6   6   6   3   4   6   6   6   6
 7|  1   7   7   7   7   7   7   1   7   7   7   7   7   7
 8|  1   8   4   8   2   8   4   8   7   8   8   8   4   8
 9|  1   9   9   3   9   9   3   9   9   1   9   9   6   9
10|  1  10   5  10  10   2   5  10  10  10   3  10   5  10
11|  1  11  11  11  11  11  11  11  11  11  11   1  11  11
12|  1  12   6   4   9  12   4  12  12   8   6  12   6  12
13|  1  13  13  13  13  13  13  13  13  13  13  13  13   1
14|  1  14   7  14   7  14  14   2   7  14  14  14  14  14
15|  1  15  15   5  15   3  10  15  15  10  15  15   5  15
16|  1  16   8  16   4  16   8  16  10  16   8  16  12  16

G. C. Greubel, Antidiagonals n = 1..100, flattened

Rows: A000012, A083952, A083953, A083954, A083945, A083946, A083947, A083948, A083949, A083950, A084066, A084067.
Columns: A000012, A111627, A026741, A051176, A111607, A060791, A111608, A106608, A111609, A111610, A111611, A106612, A106614, A106618, A106620.
Diagonals: A000027 (main), A111614 (first upper), A111627 (2nd), A111615 (3rd), A111618 (first lower), A111623 (2nd).
Other diagonals: A005408 (T(2*n-1, n)), A111626, A111627, A111628, A111629, A111630.
Cf. A111603, A111604.

f[n_]:= f[n]= Block[{a}, a[0] = 1; a[l_]:= a[l]= Block[{k = 1, s = Sum[ a[i]*x^i, {i,0,l-1}]}, While[ IntegerQ[Last[CoefficientList[Series[(s + k*x^l)^(1/n), {x, 0, l}], x]]] != True, k++ ]; k]; Table[a[j], {j,0,32}]];
T[n_, m_]:= f[n][[m]];
Flatten[Table[T[i,n-i], {n,15}, {i,n-1,1,-1}]]

A109626_row(n, len=40)={my(A=1, m); vector(len, k, if(k>m=1, while(denominator(polcoeff(sqrtn(O(x^k)+A+=x^(k-1), n), k-1))>1, m++); m, 1))} \\ M. F. Hasler, Jan 27 2025

When m is prime, column m is T(n,m) = n/gcd(m, n) = numerator of n/(n+m). - M. F. Hasler, Jan 27 2025

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

Original entry on oeis.org

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

cp's OEIS Frontend

A110641 Every 10th term of A083950.

Views

Author

Keywords

Crossrefs

Programs

PARI

A084210 G.f. A(x) defined by: A(x)^10 consists entirely of integer coefficients between 1 and 10 (A083950); A(x) is the unique power series solution with A(0)=1.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

A110642 Every 5th term of A083950 where the self-convolution 5th power is congruent modulo 25 to A083950, which consists entirely of numbers 1 through 10.

Views

Author

Keywords

Examples

Crossrefs

Programs

PARI

A110643 Every 2nd term of A083950 where the self-convolution 2nd power is congruent modulo 4 to A083950, which consists entirely of numbers 1 through 10.

Views

Author

Keywords

Examples

Crossrefs

Programs

PARI

A109626 Consider the array T(n,m) where the n-th row is the sequence of integer coefficients of A(x), where 1<=a(n)<=n, such that A(x)^(1/n) consists entirely of integer coefficients and where m is the (m+1)-th coefficient. This is the antidiagonal read from lower left to upper right.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

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