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.

A316191 List of indices where the maximum of {A316190(j) | j<=n} increases.

Original entry on oeis.org

1, 11, 37, 89, 211, 1344, 1345, 1346, 2503, 3967, 15704, 15705, 16033, 19634, 19635, 24281, 31428, 31429, 31430, 31431, 31432, 31433, 38501, 58831, 155964, 203713, 206699
Offset: 1

Views

Author

Peter Luschny, Jun 26 2018

Keywords

Examples

			a(3) = 37 because A316190(37) = 4 > 2 = max{A316190(n) : 1 <= n < 37}.
		

Crossrefs

Programs

  • Maple
    A316191_list := proc(N) local R,a,A,n,mx; R := NULL;
    A := A316190_list(N); n := 1; mx := 0;
    for a in A do
       if a > mx then mx := a; R := R,n fi;
       n := n + 1;
    od; [R] end:
    A316191_list(10000);

A309913 Distance from n to closest squarefree number that is different from n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1
Offset: 0

Views

Author

Ilya Gutkovskiy, Aug 22 2019

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := Module[{k = 1}, While[! SquareFreeQ[n + k] && ! SquareFreeQ[n - k], k++]; k]; Table[a[n], {n, 0, 100}]
Showing 1-2 of 2 results.