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.

A127975 Repeat 3^n three times.

Original entry on oeis.org

1, 1, 1, 3, 3, 3, 9, 9, 9, 27, 27, 27, 81, 81, 81, 243, 243, 243, 729, 729, 729, 2187, 2187, 2187, 6561, 6561, 6561, 19683, 19683, 19683, 59049, 59049, 59049, 177147, 177147, 177147, 531441, 531441, 531441, 1594323, 1594323, 1594323, 4782969, 4782969, 4782969
Offset: 0

Views

Author

Paul Barry, Feb 09 2007

Keywords

Comments

a(n) is the number of functions f:[n+1]->[3] with f(1)=1 and with f(x)=f(y) whenever y=ceiling(x/3). - Dennis P. Walsh, Sep 06 2018

Examples

			a(6)=9 since there are exactly 9 functions f:[7]->[3], denoted by <f(1),f(2),...,f(7)>, with f(1)=1 and with f(x)=f(y) whenever y=ceiling(x/3). The nine functions are <1,1,1,1,1,1,1>, <1,1,1,1,1,1,2>, <1,1,1,1,1,1,3>, <1,1,1,2,2,2,1>, <1,1,1,2,2,2,2>, <1,1,1,2,2,2,3>, <1,1,1,3,3,3,1>, <1,1,1,3,3,3,2>, and <1,1,1,3,3,3,3>. - _Dennis P. Walsh_, Sep 06 2018
		

Crossrefs

Programs

Formula

G.f.: (1+x+x^2)/(1-3*x^3).

Extensions

Edited and corrected by R. J. Mathar, Jun 14 2008