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 A182174 #27 Sep 08 2022 08:45:55
%S A182174 3,7,22,45,116,163,282,353,520,831,950,1357,1668,1835,2194,2793,3464,
%T A182174 3703,4470,5021,5308,6219,6866,7897,9384,10175,10582,11421,11852,
%U A182174 12739,16098,17129,18736,19287,22166,22765,24612,26531,27850,29889,32000,32719,36438,37205,38764,39555,44474,49681
%N A182174 a(n) = prime(n)^2 - n.
%C A182174 One way to find a run of n consecutive nonsquarefree numbers such that the first n primes appear in order as factors of numbers in the run is to use the Chinese remainder theorem (though this run is most likely not the earliest of length n).
%C A182174 The moduli are then of course the squares of the first n primes, while the remainders are then the first n terms of this sequence. (See A182433.)
%H A182174 Vincenzo Librandi, <a href="/A182174/b182174.txt">Table of n, a(n) for n = 1..10000</a>
%F A182174 a(n) = A000040(n)^2 - n = A001248(n) - n. - _Omar E. Pol_, Apr 16 2012
%e A182174 a(4) = 45 because the 4th prime is 7, and 7^2 - 4 = 49 - 4 = 45.
%t A182174 Table[Prime[n]^2 - n, {n, 50}]
%o A182174 (Magma) [NthPrime(n)^2-n: n in [1..50]]; // _Bruno Berselli_, Apr 16 2012
%Y A182174 Cf. A001248 squares of primes; A045882 and A078144 pertain to runs of consecutive nonsquarefree numbers.
%Y A182174 Cf. A014689. [_Bruno Berselli_, Mar 19 2013]
%K A182174 nonn,easy
%O A182174 1,1
%A A182174 _Alonso del Arte_, Apr 16 2012
%E A182174 a(36) inserted by _Vincenzo Librandi_, Mar 19 2013