%I #32 Oct 26 2016 05:34:11
%S 110,121,192,280,291,1010,1021,1092,1283,1654,2080,2091,2162,2353,
%T 2724,3270,3281,3352,3543,3914,4640,4651,4722,4913,10010,10021,10092,
%U 10283,10654,11265,12176,13447,15138,17309,20080,20091,20162,20353,20724,21335,22246,23517,25208,27379,30270,30281,30352
%N Numbers with at least three digits and with the property that the sum of the cubes of the first and last digit equals the number obtained when the first and last digits are deleted.
%C More precisely, numbers n = d_1 d_2 d_3 ... d_k such that (d_1)^3 + (d_k)^3 = d_2 d_3 ... d_{k-1}.
%C Here, d_2 may or may not be zero.
%C This sequence is infinite (it contains the numbers 1000...00010).
%C A274945 is a similar sequence where squares are used instead of cubes.
%H Biswarup Banerjee, <a href="https://biswarupbanerjee.quora.com/The-StairCase-Sequence">The StairCase Sequence, Para: 8</a>
%e 12176 is a term because 1^3 + 6^3 = 217, coming from 1_217_6;
%e 607288 is a term because 6^3 + 8^3 = 728, coming from 6_0728_8.
%t Select[Range[10^2, 10^5], (#[[1]]^3 + #[[-1]]^3) == FromDigits@ Most@ Rest@ # &@ IntegerDigits@ # &] (* _Michael De Vlieger_, Jul 25 2016 *)
%o (PARI) isok(n) = my(d = digits(n)); d[1]^3+d[#d]^3 == (n - d[#d] - 10^(#d-1)*d[1])/10; \\ _Michel Marcus_, Sep 24 2016
%Y Cf. A274945, A274944.
%K nonn,base
%O 1,1
%A _Biswarup Banerjee_, Jul 23 2016