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 A114562 #13 Apr 01 2021 02:42:45
%S A114562 1,4,3,8,5,36,7,16,9,20,11,72,13,28,15,32,17,108,19,40,21,44,23,144,
%T A114562 25,52,27,56,29,900,31,64,33,68,35,216,37,76,39,80,41,252,43,88,45,92,
%U A114562 47,288,49,100,51,104,53,324,55,112,57,116,59,1800,61,124,63,128,65,396,67
%N A114562 The first occurrence of n in A111701.
%H A114562 Amiram Eldar, <a href="/A114562/b114562.txt">Table of n, a(n) for n = 1..10000</a>
%F A114562 a(2n-1) = 2n-1; a(2n) = k*4n for some k>0, if 2n == 0 (mod 3) then k = 3, if 2n ==0 (15 mod) k = 3*5, if 2n ==0 (105 mod) k = 3*5*7, if 2n ==0 (1155 mod) k = 3*5*7*11, etc.
%F A114562 a(n) = n*A053589(n). - _David A. Corneth_, Mar 30 2021
%t A114562 f[n_] := Block[{m = n, k = 1}, While[ IntegerQ[ m/Prime@k], m = m/Prime@k; k++ ]; m]; g[n_] := Block[{k = 1}, While[f@k != n, k++ ]; k]; Array[g, 67]
%Y A114562 Cf. A053589, A111701.
%Y A114562 Complement of this sequence A095300.
%K A114562 nonn
%O A114562 1,2
%A A114562 _Robert G. Wilson v_, Feb 04 2006