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.
%I A083481 #41 Jul 10 2024 02:57:46
%S A083481 2,6,3,5,30,42,14,2,10,110,33,39,182,210,15,17,34,38,95,105,462,506,
%T A083481 138,6,26,78,21,203,870,930,62,66,1122,1190,35,37,1406,1482,390,410,
%U A083481 1722,1806,473,55,230,2162,141,3,2,102,663,689,318,330,770,798,3306,3422,885
%N A083481 Squarefree part of the n-th oblong number.
%C A083481 Smallest k such that n*(n+1)*k is a perfect square.
%C A083481 k = p*q*r... is a squarefree number where p,q,r are those prime factors of n(n+1) which have odd index.
%H A083481 Harvey P. Dale, <a href="/A083481/b083481.txt">Table of n, a(n) for n = 1..500</a>
%H A083481 John M. Campbell, <a href="http://arxiv.org/abs/1105.3399">An Integral Representation of Kekulé Numbers, and Double Integrals Related to Smarandache Sequences</a>, arXiv preprint arXiv:1105.3399 [math.GM], 2011.
%F A083481 a(n) = A007913(n*(n+1)). - _R. J. Mathar_, Nov 02 2011
%F A083481 a(n) = A007913(n) * A007913(n+1). - _Amiram Eldar_, Jul 10 2024
%p A083481 A083481 := proc(n)
%p A083481 A007913(n)*A007913(n+1) ;
%p A083481 end proc:
%p A083481 seq( A083481(n),n=1..40) ; # _R. J. Mathar_, Mar 15 2023
%t A083481 sk[n_]:=Module[{k=1},While[!IntegerQ[Sqrt[n*k]],k++];k]; sk/@Table[n(n+1),{n,60}] (* _Harvey P. Dale_, Mar 28 2013 *)
%o A083481 (PARI) a(n)=core(n*(n+1))
%o A083481 (Python)
%o A083481 from sympy.ntheory.factor_ import core
%o A083481 def A083481(n): return core(n*(n+1)) # _Chai Wah Wu_, Mar 20 2023
%Y A083481 Cf. A002378, A007913, A083482.
%K A083481 nonn,easy
%O A083481 1,1
%A A083481 _Amarnath Murthy_ and Meenakshi Srikanth (menakan_s(AT)yahoo.com), May 03 2003
%E A083481 More terms from _Benoit Cloitre_, May 04 2003