cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

A108921 A083350 read mod 3.

Original entry on oeis.org

1, 1, 1, 2, 0, 0, 0, 2, 1, 2, 0, 1, 0, 0, 1, 1, 2, 2, 1, 0, 1, 0, 1, 1, 2, 2, 1, 2, 0, 1, 0, 1, 2, 0, 1, 2, 1
Offset: 0

Views

Author

N. J. A. Sloane and Nadia Heninger, Jul 22 2005

Keywords

A083349 Least positive integers not appearing previously such that the self-convolution cube-root of this sequence consists entirely of integers.

Original entry on oeis.org

1, 3, 6, 4, 9, 12, 7, 15, 18, 2, 21, 24, 27, 30, 33, 36, 39, 42, 45, 48, 51, 5, 54, 57, 10, 60, 63, 8, 66, 69, 72, 75, 78, 13, 81, 84, 87, 90, 93, 96, 99, 102, 16, 105, 108, 19, 111, 114, 11, 117, 120, 14, 123, 126, 22, 129, 132, 135, 138, 141, 25, 144, 147, 150, 153, 156, 28
Offset: 0

Views

Author

Paul D. Hanna, Apr 25 2003; revised May 01 2005

Keywords

Comments

A permutation of the positive integers. Positive integers congruent to 1 (mod 3) appear in ascending order at positions given by A106213. Positive integers congruent to 2 (mod 3) appear in ascending order at positions given by A106214. The self-convolution cube-root is A083350.

Examples

			The self-convolution cube of A083350 equals this sequence: {1, 1, 1, -1, 3, 0, -6, 17, -17, -19, 114, ...}^3 = {1, 3, 6, 4, 9, 12, 7, 15, 18, ...}.
A083350(x)^3 = A(x) = 1 + 3x + 6x^2 + 4x^3 + 9x^4 + 12x^5 + 7x^6 + ...
		

Crossrefs

Programs

  • Mathematica
    a[n_] := a[n] = Module[{A, P, t}, A = 1+3x; P = Table[0, 3(n+1)]; P[[1]] = 1; P[[3]] = 2; For[j = 2, j <= n, j++, For[k = 2, k <= 3(n+1), k++, If[P[[k]] == 0, t = Coefficient[(A + k x^j + x^2 O[x]^j)^(1/3), x, j]; If[Denominator[t] == 1, P[[k]] = j+1; A = A + k*x^j; Break[]]]]]; Coefficient[A + x O[x]^n, x, n]];
    Table[Print["a(", n, ") = ", a[n]]; a[n], {n, 0, 66}] (* Jean-François Alcover, Jul 25 2018, translated from PARI *)
  • PARI
    {a(n)=local(A=1+3*x,P=vector(3*(n+1)));P[1]=1;P[3]=2; for(j=2,n, for(k=2,3*(n+1),if(P[k]==0, t=polcoeff((A+k*x^j+x^2*O(x^j))^(1/3),j); if(denominator(t)==1,P[k]=j+1;A=A+k*x^j;break)))); return(polcoeff(A+x*O(x^n),n))}

A106213 Positions n where A083349(n) = 1 (mod 3).

Original entry on oeis.org

0, 3, 6, 24, 33, 42, 45, 54, 60, 66, 69, 78, 87, 93, 102, 108, 111, 120, 129, 144, 153, 162, 165, 174, 183, 186, 195, 204, 213, 216, 225, 228, 231, 237, 240, 258, 261, 267, 279, 285, 300, 306, 312, 321, 333, 336, 351, 363, 366, 384, 390, 408, 414, 417, 420, 429
Offset: 0

Views

Author

Paul D. Hanna, May 01 2005

Keywords

Comments

A083349 is the minimal permutation of the positive integers having a self-convolution cube-root.

Crossrefs

Programs

  • PARI
    
    				

Formula

a(n) = 0 (mod 3) for n>=0.

A106214 Positions n where A083349(n) = 2 (mod 3).

Original entry on oeis.org

9, 21, 27, 48, 51, 72, 75, 81, 96, 105, 114, 117, 123, 126, 132, 135, 147, 156, 159, 177, 180, 189, 198, 201, 207, 222, 234, 252, 255, 264, 273, 288, 291, 294, 309, 315, 324, 339, 357, 360, 378, 387, 393, 399, 402, 432, 438, 444, 450, 456
Offset: 0

Views

Author

Paul D. Hanna, May 01 2005

Keywords

Comments

A083349 is the minimal permutation of the positive integers having a self-convolution cube-root.

Crossrefs

Formula

a(n) = 0 (mod 3) for n>=0.
Showing 1-4 of 4 results.