The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038209 Can express a(n) with the digits of a(n)^3 in order, only adding plus signs. 2
0, 1, 8, 10, 17, 18, 26, 27, 28, 45, 55, 62, 63, 71, 72, 81, 82, 89, 91, 99, 100, 107, 108, 109, 116, 125, 134, 136, 143, 144, 145, 153, 154, 161, 181, 188, 189, 197, 198, 199, 206, 207, 208, 215, 216, 224, 226, 233, 234, 235, 242, 243, 244, 253, 261, 262, 269 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
All terms == 0, 1 or 8 (mod 9). - Robert Israel, Sep 07 2020
LINKS
EXAMPLE
62^3 = 238328 and 23+8+3+28 = 62.
MAPLE
F:= proc(n, t) local d; option remember;
if n = t then return true fi;
if n < t then return false fi;
for d from 1 to min(ilog10(t)+1, ilog10(n)+1) do
if procname(floor(n/10^d), t - (n mod 10^d)) then return true fi
od;
false
end proc:
A:=select(t -> F(t^3, t), [$0..1000]); # Robert Israel, Sep 07 2020
CROSSREFS
Sequence in context: A289687 A155966 A228072 * A319293 A061908 A056020
KEYWORD
nonn,base
AUTHOR
EXTENSIONS
Offset changed by Robert Israel, Sep 07 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 15 12:11 EDT 2024. Contains 372540 sequences. (Running on oeis4.)