cp's OEIS Frontend

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.

A180106 Semiprimes which are the sum of three distinct positive cubes of semiprime numbers in two or more distinct ways.

This page as a plain text file.
%I A180106 #12 May 21 2017 23:58:42
%S A180106 88073,195905,196057,196841,205102,211466,610903,747209,809966,
%T A180106 1078622,1543267,1828441,1967402,2143783,2312029,2803501,3055258,
%U A180106 3108673,3244466,3477629,3662567,4237577,4770137,5741074,5835593,5908889,7189265,7497118,8438249,8742781
%N A180106 Semiprimes which are the sum of three distinct positive cubes of semiprime numbers in two or more distinct ways.
%C A180106 610903 = 74^3+55^3+34^3 = 82^3+39^3+6^3.
%C A180106 88073 = 29*3037 = 21^3+33^3+35^3 = 25^3+26^3+38^3. - _Chai Wah Wu_, May 20 2017
%H A180106 Chai Wah Wu, <a href="/A180106/b180106.txt">Table of n, a(n) for n = 1..10000</a>
%t A180106 f[n_] := PrimeOmega@ n == 2; lst = {}; Do[Do[Do[If[And[f[a], f[b], f[c], f[p = a^3 + b^3 + c^3]], AppendTo[lst, p]], {c, b - 1, 1, -1}], {b, a - 1, 1, -1}], {a, 200}]; lst1 = Sort@ lst; lst = {}; Do[If[lst1[[n]] == lst1[[n + 1]], AppendTo[lst, lst1[[n]]]], {n, Length[lst1] - 1}]; lst (* Corrected by _Michael De Vlieger_, May 21 2017 *)
%Y A180106 Cf. A011541, A024974, A025400, A122723, A180088, A180089, A180099
%K A180106 nonn
%O A180106 1,1
%A A180106 _Vladimir Joseph Stephan Orlovsky_, Aug 10 2010
%E A180106 Terms corrected by _Chai Wah Wu_, May 20 2017