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.

A067096 Floor[X/Y] where X = concatenation in increasing order of first n even numbers and Y = that of first n natural numbers.

Original entry on oeis.org

2, 2, 2, 2, 19, 199, 1999, 19991, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916, 199916
Offset: 1

Views

Author

Amarnath Murthy, Jan 07 2002

Keywords

Comments

Almost all terms appear only once. However, in the first 5000 terms, the term 2 appears 4 times in a row; the term 199916 appears 41 times in a row; the term 19991620000261183803815753482837892477715440187362570807 appears 401 times in a row; and a term with 556 digits (that begins with the same digits as the term that appears 401 times in a row) appears 4001 times in a row. Does this pattern continue? - Harvey P. Dale, Jul 04 2012

Examples

			a(10) = floor[ 2468101214161820/12345678910] = floor[199916.20000441271803658143252326] = 199916.
		

Crossrefs

Programs

  • Mathematica
    f[n_] := (k = 1; x = y = "0"; While[k < n + 1, x = StringJoin[x, ToString[2^k]]; y = StringJoin[y, ToString[k]]; k++ ]; Return[ Floor[ ToExpression[x] / ToExpression[y]]] ); Table[ f[n], {n, 1, 40} ]
    ccat[n_,i_]:=FromDigits[Flatten[IntegerDigits/@Range[i,n,i]]]; Table[ Floor[ ccat[2m,2]/ccat[m,1]],{m,40}] (* Harvey P. Dale, Jul 04 2012 *)

Extensions

More terms from Robert G. Wilson v, Jan 09 2002