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-2 of 2 results.

A327297 Terms in A003656 that are not prime powers (A246655).

Original entry on oeis.org

12, 21, 24, 28, 33, 44, 56, 57, 69, 76, 77, 88, 92, 93, 124, 129, 133, 141, 152, 161, 172, 177, 184, 188, 201, 209, 213, 217, 236, 237, 248, 249, 253, 268, 284, 301, 309, 329, 332, 341, 344, 376, 381, 393, 412, 413, 417, 428, 437, 453, 472, 489, 497, 501, 508, 517, 524, 536, 537, 553, 556, 573, 581, 589, 597
Offset: 1

Views

Author

Jianing Song, Sep 16 2019

Keywords

Comments

Conjecture: if D is a term of this sequence, then D = uv, where u, v are 4, 8 or primes congruent to 3 modulo 4. For example, a(1) = 12 = 3*4, a(2) = 21 = 3*7, a(3) = 24 = 3*8, a(4) = 28 = 4*7, a(5) = 33 = 3*11, ... [This conjecture is correct: see Theorem 1 and Theorem 2 of Ezra Brown link; see also A003656. - Jianing Song, Dec 28 2021]
Let k be the quadratic field with discriminant D, O_k be ring of integers of k, N(x) be the norm of x and (D/p) be the Kronecker symbol. If D is a term of this sequence and D = uv, where u, v are 4, 8 or primes congruent to 3 modulo 4, then:
(a) if (((-u)/p), ((-v)/p)) = (1, 1), (1, 0) or (0, 1), then N(x) = p has solutions in O_k, while N(y) = -p has no solutions in k. For example, for D = 21 and p = 37, we have ((-3)/37) = ((-7)/37) = 1, and N(x) = 37 has solution x = (13 + sqrt(21))/2, but N(y) = -37 has no solutions in Q(sqrt(21)).
(b) if (((-u)/p), ((-v)/p)) = (-1, -1), (-1, 0) or (0, -1), then N(x) = -p has solutions in O_k, while N(y) = p has no solutions in k. For example, for D = 12 and p = 11, we have ((-3)/11) = ((-4)/11) = -1, and N(x) = -11 has solution x = 1 + 2*sqrt(3), but N(y) = 11 has no solutions in Q(sqrt(3)).
(c) if (((-u)/p), ((-v)/p)) = (1, -1) or (-1, 1), then N(x) = +-p has no solutions in k.
The smallest number of the form above that is not in this sequence is 316 = 4*79.
Also, it is conjectured that the quadratic field with discriminant D has form class number 2, where D is a term of this sequence. This is equivalent to the conjecture above. [This can also be deduced from the first paragraph of Ezra Brown link: the norm of the fundamental unit of the field k is -1 if D = 8 or a prime congruent to 1 modulo 4, and 1 if D is in this sequence. Here k is the quadratic field with discriminant D. - Jianing Song, Dec 28 2021]

Crossrefs

Subsequence of A003656 and A003658.
Complement of A003655 with respect to A003656.

Programs

  • PARI
    isA327297(D) = if(D>1&&isfundamental(D), quadclassunit(D)[1]==1&&!isprimepower(D), 0)

A235467 Primes whose base-4 representation also is the base-3 representation of a prime.

Original entry on oeis.org

2, 89, 137, 149, 281, 293, 353, 389, 409, 421, 593, 613, 661, 1097, 1109, 1289, 1301, 1321, 1381, 1409, 1601, 1609, 1669, 2069, 2129, 2309, 2377, 2389, 2729, 4133, 4229, 4373, 4441, 4513, 4673, 5153
Offset: 1

Views

Author

M. F. Hasler, Jan 12 2014

Keywords

Comments

This sequence is part of the two-dimensional array of sequences based on this same idea for any two different bases b, c > 1. Sequence A235265 and A235266 are the most elementary ones in this list. Sequences A089971, A089981 and A090707 through A090721, and sequences A065720 - A065727, follow the same idea with one base equal to 10.
For further motivation and cross-references, see sequence A235265 which is the main entry for this whole family of sequences.
This is a subsequence of A002144, A002313, A003655, A050150, A062090, A141293, A175768, A192592, A226181 (conjectural).

Examples

			E.g., 89 = 1121_4 and 1121_3 = 43 both are prime.
		

Crossrefs

Cf. A065720A036952, A065721 - A065727, A235394, A235395, A089971A020449, A089981, A090707 - A091924, A235461 - A235482. See the LINK for further cross-references.

Programs

  • Mathematica
    b4b3Q[n_]:=Module[{b4=IntegerDigits[n,4]},Max[b4]<3&&PrimeQ[ FromDigits[ b4,3]]]; Select[Prime[Range[700]],b4b3Q] (* Harvey P. Dale, Dec 14 2021 *)
  • PARI
    is(p,b=3,c=4)=vecmax(d=digits(p,c))
    				
  • PARI
    forprime(p=1,1e3,is(p,4,3)&&print1(vector(#d=digits(p,3),i,4^(#d-i))*d~,",")) \\ To produce the terms, this is more efficient than to select them using straightforwardly is(.)=is(.,3,4)
Showing 1-2 of 2 results.