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.

Showing 1-1 of 1 results.

A182643 A182642(n) - A107857(n-1) for n>=1.

Original entry on oeis.org

0, 1, 4, 6, 18, 31, 82, 132, 348, 565, 1480, 2394, 6270, 10147, 26566, 42984, 112536, 182089, 476716, 771342, 2019402, 3267463, 8554330, 13841196, 36236725, 58632253, 153501232, 248370211, 650241655
Offset: 1

Views

Author

Clark Kimberling, Nov 24 2010

Keywords

Comments

A182643(n) = distance from A107857(n-1) to A182642(n), where A182642(n) is the result of removing all but the outermost floor function in the formula for A107857 - so that n-1 floors are removed and the n-th remains.

Examples

			a(3)=floor(s*r*s)-floor(s*floor(r*floor(s))), where
r=(1+sqrt(5))/2 and s=r+1.

Crossrefs

Cf. A107857,A182642.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.