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

A071277 a(1) = 1; a(n) = smallest palindrome which is a nontrivial product of n palindromes (repetitions allowed).

Original entry on oeis.org

1, 4, 8, 88, 252, 2112, 2112, 2112, 4224, 8448, 48384, 48384, 405504, 405504, 405504, 40955904, 677707776, 677707776, 677707776, 677707776
Offset: 1

Views

Author

Amarnath Murthy, Jun 07 2002

Keywords

Examples

			a(4) = 88 = 2*2*2*11.
a(5) = 252 = 2*2*3*3*7.
		

Crossrefs

Extensions

Corrected and extended by Sascha Kurz, Jan 02 2003
Name corrected by Robert Israel, Jan 08 2025

A071276 a(1) = 1; a(n) = smallest palindrome which is a nontrivial product of n distinct palindromes.

Original entry on oeis.org

1, 6, 66, 252, 2112, 46464, 23677632, 880121088, 88892229888
Offset: 1

Views

Author

Amarnath Murthy, Jun 07 2002

Keywords

Examples

			252=2*3*6*7 => a(4)=252.
		

Crossrefs

Extensions

Corrected and extended by Sascha Kurz, Jan 02 2003
a(7)-a(8) from Sean A. Irvine, Jul 07 2024
a(9) from Michael S. Branicky, Jul 08 2024
Name corrected by Robert Israel, Jan 08 2025

A380657 Numbers whose prime factorization has more Pythagorean prime factors than non-Pythagorean prime factors (including multiplicities).

Original entry on oeis.org

5, 13, 17, 25, 29, 37, 41, 50, 53, 61, 65, 73, 75, 85, 89, 97, 101, 109, 113, 125, 130, 137, 145, 149, 157, 169, 170, 173, 175, 181, 185, 193, 195, 197, 205, 221, 229, 233, 241, 250, 255, 257, 265, 269, 275, 277, 281, 289, 290, 293, 305, 313, 317, 325, 337
Offset: 1

Views

Author

Clark Kimberling, Jan 30 2025

Keywords

Examples

			50 appears because 2*5*5 has 2 Pythagorean prime factors but only 1 non-Pythagorean prime factor.
		

Crossrefs

Programs

  • Mathematica
    f[{x_, y_}] := If[Mod[x, 4] == 1, y, -y];
    s[n_] := Map[f, FactorInteger[n]];
    p[n_] := {Total[Select[s[n], # > 0 &]], -Total[Select[s[n], # < 0 &]]};
    p[1] = {0, 0};
    t = Table[p[n], {n, 1, 500}];
    u = Map[First, t];  (* A083025 *)
    v = Map[Last, t] ;  (* A376961 *)
    v - u (* A377625 *);
    Flatten[Position[v - u, -1]]  (* this sequence *)
Showing 1-3 of 3 results.