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.

A346599 Smallest k such that A344005(k) = n.

Original entry on oeis.org

1, 3, 4, 5, 15, 7, 8, 9, 45, 11, 33, 13, 91, 35, 16, 17, 51, 19, 76, 84, 77, 23, 69, 25, 65, 27, 63, 29, 87, 31, 32, 88, 187, 85, 180, 37, 703, 247, 104, 41, 123, 43, 172, 99, 115, 47, 141, 49, 175, 255, 204, 53, 159, 135, 280, 133, 551, 59, 177, 61, 1891, 217, 64, 160, 143, 67
Offset: 1

Views

Author

Keywords

Examples

			A344005(15) = 5 is the first appearance of 5 in A344005, so a(5) = 15.
		

Crossrefs

Programs

  • Mathematica
    Array[(k=1;n=1;While[m=1;While[!Divisible[m(m+1),n],m++];m!=#,n++];n)&,70] (* Giorgos Kalogeropoulos, Jul 29 2021 *)
  • PARI
    f(n) = my(m=1); while (m*(m+1) %n, m++); m; \\ A344005
    a(n) = my(k=1); while (f(k) !=n, k++); k; \\ Michel Marcus, Jul 29 2021