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.

A342561 List points (x,y,z) having integer coordinates, sorted first by R^2 = x^2 + y^2 + z^2 and in case of ties, then by z and last by polar angle 0 <= phi < 2*Pi in a polar coordinate system. Sequence gives x-coordinates.

Original entry on oeis.org

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

Views

Author

Hugo Pfoertner, Apr 27 2021

Keywords

Comments

This is a 3-dimensional generalization of A305575 and A305576.
y-coordinates are in A342562, z-coordinates are in A342563.
These lists can be read as an irregular table, where row r lists the respective coordinates of the points on the sphere with radius R = sqrt(r); their number (i.e., the row length) is given by A005875 = (1, 6, 12, 8, 6, 24, 24, 0, 12, 30, ...). - M. F. Hasler, Apr 27 2021

Examples

			   n    x    y    z  R^2  phi/Pi
   0    0    0    0   0   0.000
   1    0    0   -1   1   0.000
   2    1    0    0   1   0.000
   3    0    1    0   1   0.500
   4   -1    0    0   1   1.000
   5    0   -1    0   1   1.500
   6    0    0    1   1   0.000
   7    1    0   -1   2   0.000
   8    0    1   -1   2   0.500
   9   -1    0   -1   2   1.000
  10    0   -1   -1   2   1.500
  11    1    1    0   2   0.250
  12   -1    1    0   2   0.750
  13   -1   -1    0   2   1.250
  14    1   -1    0   2   1.750
  15    1    0    1   2   0.000
  16    0    1    1   2   0.500
  17   -1    0    1   2   1.000
  18    0   -1    1   2   1.500
  19    1    1   -1   3   0.250
  20   -1    1   -1   3   0.750
  21   -1   -1   -1   3   1.250
  22    1   -1   -1   3   1.750
  23    1    1    1   3   0.250
  24   -1    1    1   3   0.750
  25   -1   -1    1   3   1.250
  26    1   -1    1   3   1.750
  27    0    0   -2   4   0.000
  28    2    0    0   4   0.000
  29    0    2    0   4   0.500
		

Crossrefs

Cf. A343630, A340631, A340632, A343633 for a variant which "connects" corresponding poles of successive shells, A343640, A340641, A340642, A343643 for a square spiral variant.

Programs

  • PARI
    shell(n, Q=Qfb(1,0,1), L=List())={for(z=if(n, sqrtint((n-1)\3)+1), sqrtint(n), my(S=if(n>z^2, Set(apply(vecsort, abs(qfbsolve(Q, n-z^2, 3)))), [[0,0]])); foreach(S, s, forperm(concat(s,z), p, listput(L, p)))); for(i=1,3, for(j=1,#L, my(X=L[j]); (X[i]*=-1) && listput(L,X))); vecsort(L, (p,q)->if( p[3]!=q[3], p[3]-q[3], p[1]==q[1], q[2]-p[2], p[2]*q[2]<0, q[2]-p[2], (q[1]-p[1])*(p[2]+q[2])))} \\ Gives list of all points with Euclidean norm sqrt(n).
    A342561_vec=concat([[P[1] | P <- shell(n)] | n<-[0..7]]) \\ M. F. Hasler, Apr 27 2021

A340586 Perfect powers such that the two immediately adjacent perfect powers both have a largest exponent A025479 equal to 2.

Original entry on oeis.org

8, 16, 169, 216, 343, 400, 441, 512, 625, 729, 841, 900, 1156, 1444, 1521, 1600, 1728, 1849, 1936, 2048, 2401, 2601, 2744, 2916, 3125, 3249, 3375, 3600, 3721, 3844, 4096, 4356, 4489, 4624, 4761, 4913, 5184, 5329, 5476, 5625, 5832, 6084, 6241, 6561, 6859, 7056
Offset: 1

Views

Author

Hugo Pfoertner, Jan 14 2021

Keywords

Examples

			a(1) = 8 because its neighboring perfect powers 4 = 2^2 and 9 = 3^2 both have the largest exponent 2.
9 is not in the sequence because both exponents of the neighboring perfect powers 8 = 2^3 and 16 = 2^4 are > 2.
a(2) = 16: neighbors 9 = 3^2 and 25 = 5^2 satisfy the exponent condition.
Next excluded terms: 25 (16 = 2^4, 27 = 3^3), 27 (32 = 2^5), 32 (27 = 3^3), 36 (32 = 2^5), 49 (64 = 2^6), 64 (81 = 3^4), 81 (64 = 2^6), 100 (81 = 3^4), 121 (125 = 5^3), 125 (128 = 2^7), 128 (125 = 5^3), 144 (128 = 2^7).
a(3) = 169: neighbors 144 = 12^2 and 196 = 14^2 satisfy the exponent condition.
		

Crossrefs

Programs

  • PARI
    a340586(limit)={my(p2=999,p1=2,n2=1,n1=4);for(n=5,limit,my(p0=ispower(n));if(p0>1,if(p2+p0==4,print1(n1,", "));n2=n1;n1=n;p2=p1;p1=p0))};
    a340586(7500)

A340587 a(n) is the least root of A340586(n).

Original entry on oeis.org

2, 2, 13, 6, 7, 20, 21, 2, 5, 3, 29, 30, 34, 38, 39, 40, 12, 43, 44, 2, 7, 51, 14, 54, 5, 57, 15, 60, 61, 62, 2, 66, 67, 68, 69, 17, 72, 73, 74, 75, 18, 78, 79, 3, 19, 84, 85, 86, 87, 6, 20, 2, 92, 93, 94, 95, 21, 98, 10, 102, 22, 105, 106, 107, 108, 109, 23, 112
Offset: 1

Views

Author

Hugo Pfoertner, Jan 14 2021

Keywords

Examples

			a(1) = 2: A340586(1) = 4 = 2^2,
a(2) = 2: A340586(2) = 16 = 2^4,
a(3) = 13: A340586(3) = 169 = 13^2.
		

Crossrefs

Programs

  • PARI
    a340587(limit)={my(p2=999, p1=2, n2=1, n1=4); for(n=5, limit, my(p0=ispower(n)); if(p0>1, if(p2+p0==4, print1(round(n1^(1/p1)), ", ")); n2=n1; n1=n; p2=p1; p1=p0))};
    a340587(13000)

Formula

a(n) = A025478(A340586(n)).

A340640 Perfect powers such that the two immediately adjacent perfect powers have at least one largest exponent A025479 greater than 2.

Original entry on oeis.org

4, 9, 25, 27, 32, 36, 49, 64, 81, 100, 121, 125, 128, 144, 196, 225, 243, 256, 289, 324, 361, 484, 529, 576, 676, 784, 961, 1000, 1024, 1089, 1225, 1296, 1331, 1369, 1681, 1764, 2025, 2116, 2187, 2197, 2209, 2304, 2500, 2704, 2809, 3025, 3136, 3364, 3481, 3969
Offset: 1

Views

Author

Hugo Pfoertner, Jan 14 2021

Keywords

Examples

			a(1) = 4 because the next perfect power is 8 = 2^3, i.e., its exponent is > 2.
a(2) = 9: the exponents of the neighbors 8 = 2^3 and 16 = 2^4 are both > 2.
16 is not in the sequence because both neighboring perfect powers 9 = 3^2 and 25 = 5^2 have exponents 2.
Neighbors with exponents > 2 of the next terms: a(3) = 25 (16 = 2^3), a(4) = 27 (32 = 2^5), a(5) = 32 (27 = 3^3), a(6) = 36 (32 = 2^5), a(7) = 49 (64 = 2^6), a(8) = 64 (81 = 3^4).
		

Crossrefs

Programs

  • PARI
    a340640(limit)={my(p2=999, p1=2, n2=1, n1=4); for(n=5, limit, my(p0=ispower(n)); if(p0>1, if(p2+p0>4, print1(n1, ", ")); n2=n1; n1=n; p2=p1; p1=p0))};
    a340640(5000)
Showing 1-4 of 4 results.