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 A253975 #20 Jan 31 2015 12:05:23 %S A253975 8,23,35,59,191,119,179,239,575,359,1295,899,719,839,9215,1259,17324, %T A253975 1679,2879,15359,3599,2519,6479,61439,6299,6719,280664,5039,155924, %U A253975 7559,46079,983039,25919,10079,225224,32399,184319,15119,44099,20159,1403324,107519,25199 %N A253975 a(n) is the smallest number k representable as x*y+x+y, where x>=y>1, in exactly n ways, or -1 if no such k exists. %C A253975 a(45) = 8303765624. %C A253975 Conjecture: no term is -1. %e A253975 a(1) = 8 = 2*2+2+2. %e A253975 a(2) = 23 = 5*3+5+3 = 7*2+7+2. %e A253975 a(3) = 35 = 11*2+11+2 = 8*3+8+3 = 5*5+5+5. %K A253975 nonn %O A253975 1,1 %A A253975 _Alex Ratushnyak_, Jan 24 2015