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

 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. 4
 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 Index entries for linear recurrences with constant coefficients, signature (0,0,1). EXAMPLE Jeden, pięć, cztery, sześć, pięć, ... CROSSREFS Cf. A008962 (number of letters). Cf. A000655 (English), A061504 (French), A101432 (Spanish). 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.

Last modified September 27 15:44 EDT 2021. Contains 347691 sequences. (Running on oeis4.)