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.

A346598 a(n) is the number of terms in A344005 that are equal to n.

Original entry on oeis.org

2, 2, 2, 3, 2, 4, 3, 5, 2, 4, 4, 6, 2, 4, 7, 5, 4, 6, 4, 3, 4, 4, 6, 8, 4, 6, 7, 6, 6, 8, 5, 7, 4, 6, 4, 9, 2, 4, 8, 8, 6, 8, 4, 10, 8, 4, 8, 13, 6, 6, 7, 6, 6, 6, 8, 11, 4, 4, 10, 12, 2, 8, 13, 8, 8, 8, 4, 6, 8, 8, 10, 12, 2, 8, 9, 6, 6, 8, 8, 17, 6, 4, 10, 10, 6, 4, 11, 8, 10, 10, 8, 7, 4, 6, 11, 12
Offset: 1

Views

Author

Keywords

Comments

If A344005(n) = m then n <= m*(m+1).

Examples

			A344005(n) is equal to 4 just for n = 5, 10, and 20, so a(4) = 3.
		

Crossrefs

Programs

A346600 Indices of records in A346599.

Original entry on oeis.org

1, 2, 3, 4, 5, 9, 13, 33, 37, 61, 73, 141, 157, 193, 277, 313, 397, 421, 457, 541, 613, 661, 673, 733, 757, 877, 997, 1093, 1153, 1201, 1213, 1237, 1321, 1381, 1453, 1621, 1657, 1753, 1873, 1933, 1993, 2017, 2137, 2341, 2473, 2557, 2593, 2797, 2857, 2917, 3061
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    max=0;Monitor[Do[g=(k=1;n=1;While[m=1;While[!Divisible[m(m+1),n],m++];m!=s,n++];n);If[g>max,Print@s;max=g],{s,3000}],s] (* Giorgos Kalogeropoulos, Jul 29 2021 *)

Extensions

More terms from Chai Wah Wu, Jul 29 2021
Showing 1-2 of 2 results.