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 A239656 #8 Jan 08 2015 19:31:03 %S A239656 12,24,4,8,24,3,5,4,16,8,16,11,5,4,8,4,4,5,27,8,1,7,8,9,3,8,7,9,3,1,4, %T A239656 20,8,4,23,9,3,9,4,4,11,14,3,4,4,8,8,3,1,4,1,3,4,13,10,5,4,9,11,4,8, %U A239656 12,12,4,21,6,13,8,8,5,3,4,4,3,1,5,3,9,11,4 %N A239656 First differences of sphenic numbers, cf. A007304. %C A239656 a(n) = A007304(n+1) - A007304(n); %C A239656 see A239673 and A239674 for record values and where they occur: A239673(n) = a(A239674(n)). %H A239656 Reinhard Zumkeller, <a href="/A239656/b239656.txt">Table of n, a(n) for n = 1..10000</a> %p A239656 A007304 := proc(n) %p A239656 option remember; %p A239656 if n = 1 then %p A239656 30; %p A239656 else %p A239656 for a from procname(n-1)+1 do %p A239656 if numtheory[bigomega](a) =3 and nops(numtheory[factorset](a)) = 3 then %p A239656 return a; %p A239656 end if; %p A239656 end do: %p A239656 end if; %p A239656 end proc: %p A239656 A239656 := proc(n) %p A239656 A007304(n+1)-A007304(n) ; %p A239656 end proc: %t A239656 With[{upto=1000},Differences[Sort[Select[Times@@@Subsets[Prime[ Range[ Ceiling[upto/6]]],{3}],#<=upto&]]]] (* _Harvey P. Dale_, Jan 08 2015 *) %o A239656 (Haskell) %o A239656 a239656 n = a239656_list !! (n-1) %o A239656 a239656_list = zipWith (-) (tail a007304_list) a007304_list %Y A239656 Cf. A065516. %K A239656 nonn %O A239656 1,1 %A A239656 _Reinhard Zumkeller_, Mar 23 2014