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!)
A273281 a(1) = 1, a(n+1) = least multiple of a(n) which is a concatenation in descending order of n+1 successive positive integers. 0
1, 21, 987, 1602160116001599, 350301931135697350301931135696350301931135695350301931135694350301931135693 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
In A112364 also 0 is admitted (see a(2) = 10) while in this sequence is not.
LINKS
EXAMPLE
a(2) / a(1) = 21;
a(3) / a(2) = 47;
a(4) / a(3) = 1623262528877;
a(5) / a(4) = 218643522352760739495083693166843046731892253220075561675507.
MAPLE
P:=proc(q) local a, b, k, j, n; a:=1; print(a);
for k from 2 to q do for n from 1 to q do
b:=n; for j from 1 to k-1 do b:=(n+j)*10^(ilog10(b)+1)+b; od;
if type(b/a, integer) then a:=b; print(b); break; fi; od; od; end: P(10^9);
CROSSREFS
Sequence in context: A184133 A004704 A138473 * A186392 A360505 A263994
KEYWORD
nonn,base
AUTHOR
Paolo P. Lava, May 19 2016
EXTENSIONS
a(5) from Giovanni Resta, May 19 2016
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 April 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)