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!)
A067094 Floor[X/Y] where X = concatenation in decreasing order of (n+1)-st odd number through the 2n-th odd number and Y = concatenation in decreasing order of first n odd numbers. 9

%I #4 Dec 05 2013 19:55:07

%S 3,5,8,1115,141185,170938,200692,230447,260202,289956,319711,349465,

%T 379220,408974,438729,468483,498238,527993,557747,587502,617256,

%U 647011,676765,706520,736274,7592691,788748988,81823548335,8477219785398

%N Floor[X/Y] where X = concatenation in decreasing order of (n+1)-st odd number through the 2n-th odd number and Y = concatenation in decreasing order of first n odd numbers.

%e a(4)= floor[1513119/1357] =floor[1115.047162859248341930729550479] = 1115.

%t f[n_] := (k = 1; x = y = "0"; While[k < n + 1, x = StringJoin[ToString[2n + 2k - 1], x]; y = StringJoin[y, ToString[2k - 1]]; k++ ]; Return[ Floor[ ToExpression[x] / ToExpression[y]/10]] ); Table[ f[n], {n, 1, 32} ]

%Y Cf. A067088, A067089, A067090, A067091, A067092, A067093.

%K easy,nonn,base

%O 1,1

%A _Amarnath Murthy_, Jan 07 2002

%E More terms from _Robert G. Wilson v_, Jan 09 2002

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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)