cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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 increasing order of first n odd numbers.

This page as a plain text file.
%I A067094 #11 Nov 07 2024 08:46:18
%S A067094 3,5,8,1115,141185,170938,200692,230447,260202,289956,319711,349465,
%T A067094 379220,408974,438729,468483,498238,527993,557747,587502,617256,
%U A067094 647011,676765,706520,736274,7592691,788748988,81823548335,8477219785398
%N 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 increasing order of first n odd numbers.
%H A067094 Robert Israel, <a href="/A067094/b067094.txt">Table of n, a(n) for n = 1..2720</a>
%e A067094 a(4)= floor[1513119/1357] =floor[1115.047162859248341930729550479] = 1115.
%p A067094 f:= proc(n) local k; floor(parse(cat(seq(2*k-1,k=2*n .. n+1,-1)))/parse(cat(seq(2*k-1,k=1..n)))) end proc:
%p A067094 map(f, [$1..50]); # _Robert Israel_, Nov 06 2024
%t A067094 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 A067094 Cf. A067088, A067089, A067090, A067091, A067092, A067093.
%K A067094 easy,nonn,base,look
%O A067094 1,1
%A A067094 _Amarnath Murthy_, Jan 07 2002
%E A067094 More terms from _Robert G. Wilson v_, Jan 09 2002
%E A067094 Definition corrected by _Robert Israel_, Nov 06 2024