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 A245629 #22 Aug 15 2014 05:46:41
%S A245629 1,14,42,60,336,1638,2160,4064,4130,4464,5148,6678,7900,9856,12192,
%T A245629 13144,16464,23220,24206,26001,28665,44460,49680,53464,105656,117800,
%U A245629 125685,158160,159489,168597,173060,232128,276080,309504,320580,372384,475488,542430,580072,613500,699112,708900,787644,834561,843200,885456,914872,1215396
%N A245629 Numbers n such that A000203(2*n) divides 2*n*A045917(n).
%C A245629 Conjecture: 14 is the only natural number n for which A000203(2*n) equals 2*n*A045917(n).
%C A245629 Conjecture above is confirmed for n < 10^5. - _Derek Orr_, Jul 27 2014
%e A245629 A000203(2*14) = 56, which divides 2*14*A045917(14), which is also 56. So 14 is a member of this sequence.
%t A245629 f[n_] := Length@ Select[ 2n - Prime@ Range@ PrimePi@ n, PrimeQ]; fQ[n_] := Mod[ 2n*f[n], DivisorSigma[1, 2n]] == 0; k = 1; lst = {}; While[k < 1250001, If[ fQ@ k, AppendTo[lst, k]; Print@ k]; k++]; lst (* _Robert G. Wilson v_, Aug 07 2014 *)
%o A245629 (PARI)
%o A245629 for(n=1,10^7,my(s);forprime(p=2,n,s+=isprime(2*n-p));d=divisors(2*n);if(2*n*s%(sum(i=1,#d,d[i]))==0,print1(n,", "))) \\ _Derek Orr_, Jul 27 2014
%Y A245629 Cf. A000203, A045917.
%K A245629 nonn
%O A245629 1,2
%A A245629 _Ivan N. Ianakiev_, Jul 27 2014
%E A245629 a(18)-a(24) from _Derek Orr_, Jul 27 2014
%E A245629 a(25)-a(48) from _Robert G. Wilson v_, Aug 07 2014