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.

A328263 a(n) = number of letters in a(n-1) (in Polish), with a(1) = 1.

Original entry on oeis.org

1, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6, 5, 4, 6
Offset: 1

Views

Author

Robert Bilinski, Oct 09 2019

Keywords

Comments

a(1) = 1; for n>1, a(n) = numbers of letters in Polish name for a(n-1).
Decimal expansion of 515/333. - Elmo R. Oliveira, May 05 2024

Examples

			Jeden, pięć, cztery, sześć, pięć, ...
		

Crossrefs

Cf. A008962 (number of letters).
Cf. A000655 (English), A061504 (French), A101432 (Spanish).

Formula

a(n) = a(n-3) for n > 4. - Elmo R. Oliveira, May 05 2024