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 A081312 #15 Oct 13 2021 04:51:18
%S A081312 3,24,28,42,48,52,54,58,60,66,72,90,102,108,114,132,138,150,168,172,
%T A081312 174,180,192,196,198,214,228,234,240,246,252,264,268,270,282,294,298,
%U A081312 312,318,348,354,360,384,390,402,404,420,432,444,450,462,468,478,480,492
%N A081312 Numbers having a unique representation as sum of a prime and an 3-smooth number.
%H A081312 Reinhard Zumkeller, <a href="/A081312/b081312.txt">Table of n, a(n) for n = 1..10000</a>
%F A081312 A081308(a(n)) = 1.
%t A081312 sp3sQ[n_]:=Length[Select[IntegerPartitions[n,{2}],(PrimeQ[#[[1]]]&&Max[ FactorInteger[#[[2]]][[All,1]]]<4)||(PrimeQ[#[[2]]]&&Max[ FactorInteger[ #[[1]]][[All,1]]]<4)&]]==1; Select[Range[500],sp3sQ]/.(5->Nothing) (* _Harvey P. Dale_, Feb 05 2019 *)
%t A081312 nmax = 1000;
%t A081312 S = Select[Range[nmax], Max[FactorInteger[#][[All, 1]]] <= 3 &];
%t A081312 A081308[n_] := Count[TakeWhile[S, # < n &], s_ /; PrimeQ[n - s]];
%t A081312 Select[Range[nmax], A081308[#] == 1 &] (* _Jean-François Alcover_, Oct 13 2021 *)
%o A081312 (Haskell)
%o A081312 a081312 n = a081312_list !! (n-1)
%o A081312 a081312_list = filter ((== 1) . a081308) [1..]
%o A081312 -- _Reinhard Zumkeller_, Jul 04 2012
%Y A081312 Cf. A000040, A003586, A081308, A081313.
%Y A081312 Subsequence of A081311.
%K A081312 nonn
%O A081312 1,1
%A A081312 _Reinhard Zumkeller_, Mar 17 2003