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.

A338718 Define b(1)=1 and for n>1, b(n)=n/b(n-1); then a(n) = floor(b(n)).

Original entry on oeis.org

1, 2, 1, 2, 1, 3, 2, 3, 2, 4, 2, 4, 2, 4, 3, 5, 3, 5, 3, 5, 3, 5, 3, 6, 4, 6, 4, 6, 4, 6, 4, 7, 4, 7, 4, 7, 4, 7, 5, 7, 5, 8, 5, 8, 5, 8, 5, 8, 5, 8, 5, 9, 5, 9, 5, 9, 6, 9, 6, 9, 6, 9, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 7, 11, 7, 11, 7, 11, 7, 11, 7, 11, 7, 11, 7, 11
Offset: 1

Views

Author

N. J. A. Sloane, Nov 29 2020, following a suggestion from Anchar Koops, Nov 24 2020

Keywords

Examples

			The first few fractions b(n) are 1, 2, 3/2, 8/3, 15/8, 16/5, 35/16, 128/35, 315/128, 256/63, 693/256, 1024/231, 3003/1024, 2048/429, ...
		

Crossrefs

For the numerators and denominators of b(n) see A004731 and A004730.

Programs

  • Mathematica
    a[n_] := Floor[n!!/(n - 1)!!]; Array[a, 90] (* Robert G. Wilson v, Dec 06 2020 *)