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.

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

This page as a plain text file.
%I A067093 #3 Dec 05 2013 19:55:07
%S A067093 3,4,58,6714,81975,96852,111729,126607,141484,156361,171238,186116,
%T A067093 200993,215870,230748,245625,260502,275379,290257,305134,320011,
%U A067093 334889,349766,364643,379520,39439811,4092753962,424152673322,43902995043838
%N A067093 Floor[X/Y] where X = concatenation of (n+1)-st odd number through the 2n-th odd number and Y = concatenation of first n odd numbers.
%e A067093 a(4) = floor[9111315/1357] = floor[6714.30729550478997789240972733972] = 6714.
%t A067093 f[n_] := (k = 1; x = y = "0"; While[k < n + 1, x = StringJoin[x, ToString[2n + 2k -1]]; y = StringJoin[y, ToString[2k - 1]]; k++ ]; Return[ Floor[ ToExpression[x] / ToExpression[y]]] ); Table[ f[n], {n, 1, 32} ]
%Y A067093 Cf. A067088, A067089, A067090, A067091, A067092.
%K A067093 easy,base,nonn
%O A067093 1,1
%A A067093 _Amarnath Murthy_, Jan 07 2002
%E A067093 More terms from _Robert G. Wilson v_, Jan 09 2002