login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A328263 a(n) = number of letters in a(n-1) (in Polish), with a(1) = 1. 1
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(1) = 1; for n>1, a(n) = numbers of letters in Polish name for a(n-1).

LINKS

Robert Bilinski, Table of n, a(n) for n = 1..99

EXAMPLE

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

CROSSREFS

Cf. A000655 (English), A061504 (French), A101432 (Spanish).

Cf. A008962.

Sequence in context: A298513 A021187 A075194 * A138255 A153451 A190143

Adjacent sequences:  A328260 A328261 A328262 * A328264 A328265 A328266

KEYWORD

nonn,word,easy

AUTHOR

Robert Bilinski, Oct 09 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 24 04:35 EST 2020. Contains 331183 sequences. (Running on oeis4.)