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.

A337610 Positive integers m such that A126287^k(m) = m for some positive integer k.

Original entry on oeis.org

1, 10, 15, 22, 26, 33, 34, 46, 51, 58, 65, 69, 70, 82, 86, 87, 94, 105, 106, 118, 122, 123, 130, 134, 141, 142, 146, 154, 159, 166, 177, 178, 190, 195, 202, 206, 213, 214, 215, 218, 226, 231, 238, 249, 250, 254, 262, 266, 267, 274, 285, 286, 298, 302, 303, 310
Offset: 1

Views

Author

Ely Golden, Oct 07 2020

Keywords

Comments

A126287^k(m) means apply A126287 to m k times.
Equivalently, the numbers that belong to a cycle under the map x -> A126287(x).
For any term m in this sequence, A126287(A126287(m)) = m.
Supersequence of A017641. Moreover, this sequence (excluding the first term) can be represented as an infinite union of arithmetic progressions.
There are no primes in this sequence.

Examples

			10 is a term since A126287(A126287(10)) = A126287(15) = 10.
		

Crossrefs

A126286 a(1) = 2, a(n) = n * LeastPrimeFactor(n+1) / LeastPrimeFactor(n).

Original entry on oeis.org

2, 3, 2, 10, 2, 21, 2, 12, 6, 55, 2, 78, 2, 21, 10, 136, 2, 171, 2, 30, 14, 253, 2, 60, 10, 39, 18, 406, 2, 465, 2, 48, 22, 85, 14, 666, 2, 57, 26, 820, 2, 903, 2, 66, 30, 1081, 2, 168, 14, 75, 34, 1378, 2, 135, 22, 84, 38, 1711, 2, 1830, 2, 93, 42, 160, 26, 2211, 2, 102, 46
Offset: 1

Views

Author

Lior Manor, Dec 25 2006

Keywords

Examples

			a(6) = (6 / LeastPrimeFactor(6)) * LeastPrimeFactor(7) = 21.
		

Crossrefs

Programs

  • Mathematica
    a[1] := 2; a[n_] := n*FactorInteger[n + 1][[1, 1]]/FactorInteger[n][[1, 1]]; Table[a[n], {n, 69}] (* Ivan Neretin, May 20 2015 *)
  • PARI
    a(n) = if (n==1, 2, n*factor(n+1)[1, 1]/factor(n)[1, 1]); \\ Michel Marcus, Aug 14 2013

Formula

a(n) = A032742(n)*A020639(n+1), for n>1. - Ivan Neretin, May 20 2015

A126288 a(1) = 2, a(n) = n * LargestPrimeFactor(n+1) / LargestPrimeFactor(n).

Original entry on oeis.org

2, 3, 2, 10, 3, 14, 2, 12, 15, 22, 3, 52, 7, 10, 6, 136, 3, 114, 5, 28, 33, 46, 3, 40, 65, 6, 63, 116, 5, 186, 2, 176, 51, 14, 15, 444, 19, 26, 15, 328, 7, 258, 11, 20, 207, 94, 3, 112, 35, 170, 39, 212, 3, 198, 35, 152, 87, 118, 5, 732, 31, 14, 18, 416, 55, 402, 17, 92, 21, 710
Offset: 1

Views

Author

Lior Manor, Dec 25 2006

Keywords

Examples

			a(6) = 6 * LargestPrimeFactor(7) / LargestPrimeFactor(6) = 6 * 7 / 3 = 14
		

Crossrefs

Programs

  • Mathematica
    a[1] := 2; a[n_] := n*FactorInteger[n + 1][[-1, 1]]/FactorInteger[n][[-1, 1]]; Table[a[n], {n, 70}] (* Ivan Neretin, May 20 2015 *)
  • PARI
    gpf(n) = vecmax(factor(n)[,1]);
    a(n) = if (n==1, 2, n*gpf(n+1)/gpf(n)); \\ Michel Marcus, Sep 08 2020

Formula

a(n) = A006530(n+1)*A052126(n) for n>1. - Michel Marcus, May 20 2015

A126289 a(1) = 1, a(2) = 1, a(n) = n * LargestPrimeFactor(n-1) / LargestPrimeFactor(n).

Original entry on oeis.org

1, 1, 2, 6, 2, 10, 3, 28, 6, 6, 5, 44, 3, 26, 21, 40, 2, 102, 3, 76, 15, 14, 11, 184, 15, 10, 117, 12, 7, 174, 5, 496, 6, 22, 85, 84, 3, 74, 57, 104, 5, 246, 7, 172, 99, 10, 23, 752, 21, 70, 15, 68, 13, 954, 15, 88, 21, 38, 29, 708, 5, 122, 279, 224, 10, 78, 11, 268, 51, 230, 7
Offset: 1

Views

Author

Lior Manor, Dec 25 2006

Keywords

Examples

			a(6) = 6 * LargestPrimeFactor(5) / LargestPrimeFactor(6) = 6 * 5 / 3 = 10
		

Crossrefs

Programs

  • Mathematica
    a[1] := 1; a[2] := 1; a[n_] := n*FactorInteger[n - 1][[-1, 1]]/FactorInteger[n][[-1, 1]]; Table[a[n], {n, 71}] (* Ivan Neretin, May 20 2015 *)
  • PARI
    gpf(n) = vecmax(factor(n)[,1]); \\ A006530
    a(n) = if (n<=2, 1, n*gpf(n-1)/gpf(n)); \\ Michel Marcus, Oct 07 2020

Formula

a(n) = A006530(n-1)*A052126(n) for n>2. - Michel Marcus, May 20 2015
Showing 1-4 of 4 results.