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!)
A061491 a(1) = 1, a(n) = least number such that the concatenation a(n)a(n-1)...a(1) is a cube. 2
1, 133, 100330363, 100000000300330000300660363, 100000000000000000000000000300000000300330000000000000300000000600660000300660363 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = 10^(-3^(n-1)/2-1)*(Sum_{j=0..n-1}(10^(3^j/2))^3 - Sum_{j=0..n-2} (10^(3^j/2))^3). - Robert Israel, Jun 17 2024
EXAMPLE
a(1) = 1, a(2) = 133, a(2)a(1) = 1331 = 11^3.
MAPLE
f:= proc(n) local j; 10^(-3^(n-1)/2-1)*(add(10^(3^j/2), j=0..n-1)^3 - add(10^(3^j/2), j=0..n-2)^3) end proc:
seq(f(n), n=1..5); # Robert Israel, Jun 17 2024
CROSSREFS
Sequence in context: A055579 A191715 A208626 * A274132 A252133 A255795
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy, May 06 2001
EXTENSIONS
More terms from Ulrich Schimke (ulrschimke(AT)aol.com), Nov 06 2001
Corrected by Robert Israel, Jun 17 2024
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 July 15 05:33 EDT 2024. Contains 374324 sequences. (Running on oeis4.)