A133418 - OEIS

This site is supported by donations to The OEIS Foundation.

A133418

Let l(n) = number of letters in n, A005589(n). If l(n) = 4 set a(n) = 0; otherwise a(n) = a(l(n)) + 1.

0, 2, 2, 1, 0, 0, 2, 1, 1, 0, 2, 3, 3, 2, 2, 2, 2, 1, 2, 2, 3, 1, 1, 4, 3, 3, 1, 4, 4, 3, 3, 1, 1, 4, 3, 3, 1, 4, 4, 3, 1, 2, 2, 3, 1, 1, 2, 3, 3, 1, 1, 2, 2, 3, 1, 1, 2, 3, 3, 1, 1, 2, 2, 3, 1, 1, 2, 3, 3, 1, 2, 3, 3, 4, 4, 4, 3, 4, 4, 4, 3, 1, 1, 4, 3, 3, 1, 4, 4, 3, 3, 1, 1, 4, 3, 3, 1, 4, 4, 3, 4, 3, 3, 3, 3 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,2`
	COMMENTS	`Based on the observation by Diane Karloff (see A005589) that the trajectory of l always converges to 4.`
	LINKS	`R. J. Mathar, Table of n, a(n) for n = 0..11999` `R. J. Mathar, Maple program to make b-file`
	EXAMPLE	`5 has four letters so a(5) = 0. 3 has five letters so a(3) = a(5) + 1 = 1.`
	CROSSREFS	`A variant of A016037.` `Sequence in context: A163528 A160806 A191411 * A181169 A029390 A108040` `Adjacent sequences: A133415 A133416 A133417 * A133419 A133420 A133421`
	KEYWORD	`nonn,word,easy`
	AUTHOR	`N. J. A. Sloane, Nov 27 2007`
	STATUS	`approved`

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

Last modified May 23 14:43 EDT 2013. Contains 225604 sequences.