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.

A046399 Smallest squarefree palindrome with exactly n distinct prime factors.

Original entry on oeis.org

1, 2, 6, 66, 858, 6006, 222222, 22444422, 244868442, 6434774346, 438024420834, 50146955964105, 2415957997595142, 495677121121776594, 22181673755737618122, 5521159517777159511255, 477552751050050157255774
Offset: 0

Views

Author

Patrick De Geest, Jun 15 1998

Keywords

Comments

Initial terms of sequences A046392-A046398.

Examples

			a(4) = 858 = 2*3*11*13.
		

References

  • J.-P. Delahaye, Merveilleux nombres premiers ("Amazing primes"), p. 315, Pour la Science, Paris 2000.

Crossrefs

Programs

  • Mathematica
    r[n_] := FromDigits[Reverse[IntegerDigits[n]]]; Do[k = 1; While[r[k] != k || !SquareFreeQ[k] || Length[Select[Divisors[k], PrimeQ]] != n, k++ ]; Print[k], {n, 0, 30}] (* Ryan Propper, Sep 16 2005 *)

Extensions

Edited by N. J. A. Sloane, Dec 06 2008 at the suggestion of R. J. Mathar
a(10)-a(13) from Donovan Johnson, Oct 03 2011
a(14)-a(15) from David A. Corneth, Oct 03 2020
a(15) corrected by Daniel Suteu, Feb 05 2023
a(16) from Michael S. Branicky, Feb 08 2023

A373467 Palindromes with exactly 7 (distinct) prime divisors.

Original entry on oeis.org

20522502, 21033012, 22444422, 23555532, 24266242, 25777752, 26588562, 35888853, 36399363, 41555514, 41855814, 42066024, 43477434, 43777734, 44888844, 45999954, 47199174, 51066015, 51666615, 52777725, 53588535, 53888835, 55233255, 59911995, 60066006, 60366306, 61777716, 62588526, 62700726
Offset: 1

Views

Author

M. F. Hasler, Jun 06 2024

Keywords

Examples

			Obviously all terms must be palindromic; let us consider the prime factorization:
a(1) = 20522502 = 2 * 3^2 * 7 * 11 * 13 * 17 * 67 has exactly 7 distinct prime divisors, although the factor 3 appears twice in the factorization. (Without the second factor 3 the number would not be palindromic.)
a(2) = 21033012 = 2^2 * 3 * 7 * 11 * 13 * 17 * 103 has exactly 7 distinct prime divisors, although the factor 2 appears twice in the factorization. (Without the second factor 2 the number would not be palindromic.)
a(3) = 22444422 = 2 * 3 * 7 * 11 * 13 * 37 * 101 is the product of 7 distinct primes (cf. A123321), hence the first squarefree term of this sequence.
		

Crossrefs

Cf. A046333 (same with bigomega = 7: counting prime factors with multiplicity), A046397 (same but only squarefree terms), A373465 (same with omega = 5), A046396 (same with omega = 6).
Cf. A002113 (palindromes), A176655 (omega(.) = 7), A123321 (products of 7 distinct primes).

Programs

  • PARI
    A373467_upto(N, start=vecprod(primes(7)), num_fact=7)={ my(L=List()); while(N >= start = nxt_A002113(start), omega(start)==num_fact && listput(L, start)); L}

Formula

Intersection of A002113 and A176655.
Showing 1-2 of 2 results.