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 A253775 #15 Feb 28 2019 18:55:48 %S A253775 8,13,14,22,32,33,39,44,58,71,72,74,88,92,112,133,134,137,158,184,212, %T A253775 225,242,251,264,266,274,308,344,353,382,422,464,508,523,554,602,634, %U A253775 652,704,738,741,758,814,872,932,994,1013,1033,1036,1058,1124,1192,1262,1306 %N A253775 Numbers representable as x^y + x + y, where x>1, y>1 are integers (without multiplicity). %H A253775 Jean-François Alcover, <a href="/A253775/b253775.txt">Table of n, a(n) for n = 1..1000</a> %e A253775 a(1) = 8 = 2^2 + 2 + 2. %e A253775 a(2) = 13 = 2^3 + 2 + 3. %e A253775 a(3) = 14 = 3^2 + 3 + 2. %e A253775 a(4) = 22 = 2^4 + 2 + 4 = 4^2 + 4 + 2. - _Wolfdieter Lang_, Feb 03 2015 %p A253775 N:= 10000; # to get all terms <= N %p A253775 select(`<=`,{seq(seq(x^y+x+y, y = 2..floor(log[x](N-x))), %p A253775 x=2..floor(sqrt(N)))},N); %p A253775 # if using Maple 11 or earlier, uncomment the next line %p A253775 # sort(convert(%, list)); # _Robert Israel_, Jan 14 2015 %t A253775 M = 2000; %t A253775 Select[Table[x^y + x + y, {x, 2, Floor[Sqrt[M]]}, {y, 2, Floor[Log[x, M-x]] }] // Flatten, # <= M&] // Union (* _Jean-François Alcover_, Feb 27 2019, after _Robert Israel_ *) %Y A253775 Cf. A253776, A253777. %K A253775 nonn %O A253775 1,1 %A A253775 _Alex Ratushnyak_, Jan 12 2015