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.

A336642 One less than the largest square dividing n: a(n) = A008833(n)-1.

This page as a plain text file.
%I A336642 #7 Jul 29 2020 16:38:54
%S A336642 0,0,0,3,0,0,0,3,8,0,0,3,0,0,0,15,0,8,0,3,0,0,0,3,24,0,8,3,0,0,0,15,0,
%T A336642 0,0,35,0,0,0,3,0,0,0,3,8,0,0,15,48,24,0,3,0,8,0,3,0,0,0,3,0,0,8,63,0,
%U A336642 0,0,3,0,0,0,35,0,0,24,3,0,0,0,15,80,0,0,3,0,0,0,3,0,8,0,3,0,0,0,15,0,48,8,99,0,0,0,3,0
%N A336642 One less than the largest square dividing n: a(n) = A008833(n)-1.
%H A336642 Antti Karttunen, <a href="/A336642/b336642.txt">Table of n, a(n) for n = 1..65537</a>
%o A336642 (PARI) A336642(n) = ((n/core(n))-1);
%Y A336642 Cf. A008833.
%Y A336642 Cf. also A336551, A336641, A336644.
%K A336642 nonn
%O A336642 1,4
%A A336642 _Antti Karttunen_, Jul 28 2020