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 A062876 #41 Feb 16 2025 08:32:45
%S A062876 4,12,20,28,44,52,68,76,92,116,124,148,164,172,188,212,236,244,268,
%T A062876 284,292,316,332,356,388,404,412,428,436,452,508,524,548,556,596,604,
%U A062876 628,652,668,692,716,724,764,772,788,796,844,892,908,916,932,956,964
%N A062876 Numbers of lattice points corresponding to incrementally largest circle radii in A062875.
%C A062876 For n = 1 and n >= 3, a(n) is the smallest nonsquarefree number divisible by prime(n). - _David James Sycamore_, Jun 15 2024
%H A062876 Ray Chandler, <a href="/A062876/b062876.txt">Table of n, a(n) for n = 1..10000</a>
%H A062876 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CircleLatticePoints.html">Circle Lattice Points</a>
%F A062876 a(n) = A017113(A111333(n)-1) = 8*A111333(n) - 4.
%F A062876 For n >= 2 a(n) = 4*A000040(n) (a term in A013929). - _David James Sycamore_, Jun 15 2024
%t A062876 Join[{4}, Table[4 Prime[n], {n, 2, 50}]] (* _Vincenzo Librandi_, May 08 2015 *)
%o A062876 (Magma) [4] cat [4*NthPrime(n): n in [2..60]]; // _Vincenzo Librandi_, May 08 2015
%o A062876 (PARI) a(n)=if(n>1,4*prime(n),4) \\ _Charles R Greathouse IV_, May 08 2015
%o A062876 (Python)
%o A062876 from sympy import prime
%o A062876 def A062876(n): return prime(n)<<2 if n>1 else 4 # _Chai Wah Wu_, Aug 02 2024
%Y A062876 Cf. A046112, A062875.
%Y A062876 Cf. A017113, A111333.
%Y A062876 Cf. A000040, A103929
%K A062876 easy,nonn
%O A062876 1,1
%A A062876 _Eric W. Weisstein_
%E A062876 Edited and extended by _Ray Chandler_, Jan 05 2012