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.

A363636 Indices of numbers of the form k^2+1, k >= 0, that can be written as a product of smaller numbers of that same form.

Original entry on oeis.org

0, 3, 7, 13, 17, 18, 21, 31, 38, 43, 47, 57, 68, 73, 91, 99, 111, 117, 123, 132, 133, 157, 183, 211, 241, 242, 253, 255, 268, 273, 293, 302, 307, 313, 322, 327, 343, 381, 413, 421, 438, 443, 463, 487, 507, 515, 553, 557, 577, 593, 601, 651, 693, 697, 703, 707
Offset: 1

Views

Author

Pontus von Brömssen, Jun 19 2023

Keywords

Comments

For the corresponding sequence for numbers of the form k^3+1 instead of k^2+1, the only terms known to me are 0 and 26, with 26^3+1 = (2^3+1)^2*(6^3+1).

Examples

			0 is a term because 0^2+1 = 1 equals the empty product.
3 is a term because 3^2+1 = 10 = 2*5 = (1^2+1)*(2^2+1).
38 is a term because 38^2+1 = 1445 = 5*17*17 = (2^2+1)*(4^2+1)^2. (This is the first term that requires more than two factors.)
		

Crossrefs

Sequences that list those terms (or their indices or some other key) of a given sequence that are products of smaller terms of the same sequence (in other words, the nonprimitive terms of the multiplicative closure of the sequence):
this sequence (A002522),

Programs

  • Mathematica
    g[lst_, p_] :=
      Module[{t, i, j},
       Union[Flatten[Table[t = lst[[i]]; t[[j]] = p*t[[j]];
          Sort[t], {i, Length[lst]}, {j, Length[lst[[i]]]}], 1],
        Table[Sort[Append[lst[[i]], p]], {i, Length[lst]}]]];
    multPartition[n_] :=
      Module[{i, j, p, e, lst = {{}}}, {p, e} =
        Transpose[FactorInteger[n]];
       Do[lst = g[lst, p[[i]]], {i, Length[p]}, {j, e[[i]]}]; lst];
    output = Join[{0}, Flatten[Position[Table[
         test = Sqrt[multPartition[n^2 + 1][[2 ;; All]] - 1];
         Count[AllTrue[#, IntegerQ] & /@ test, True] > 0
         , {n, 707}], True]]]
    (* David Trimas, Jul 23 2023 *)

A363750 Primes p such that p-1 can be written as a product of smaller numbers that are also of the form prime-1.

Original entry on oeis.org

2, 5, 13, 17, 37, 41, 61, 73, 89, 97, 101, 109, 113, 157, 181, 193, 233, 241, 257, 277, 281, 313, 337, 349, 353, 397, 401, 409, 421, 433, 449, 457, 461, 521, 541, 577, 593, 601, 613, 617, 641, 661, 673, 701, 733, 757, 761, 769, 821, 829, 877, 881, 929, 937
Offset: 1

Views

Author

Pontus von Brömssen, Jun 19 2023

Keywords

Comments

Except for 2, this is a subsequence of primes of the form 4k+1 (A002144). - Davide Rotondo, Oct 07 2024

Examples

			2 is a term because 2 is prime and 2-1 = 1 equals the empty product.
5 is a term because 5 is prime, 5-1 = 2*2 = (3-1)*(3-1), and 3 is prime.
3329 is a term because 3329 is prime, 3329-1 = 4*16*52 = (5-1)*(17-1)*(53-1), and 5, 17, and 53 are prime. (This is the first term that requires more than two factors.)
		

Crossrefs

Showing 1-2 of 2 results.