id:A133418 - OEIS Search Results

Search: id:A133418

Displaying 1-1 of 1 results found.

page 1

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

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; listen)

	OFFSET	`0,2`
	COMMENT	`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: A051168 A163528 A160806 this_sequence A029390 A108040 A137566` `Adjacent sequences: A133415 A133416 A133417 this_sequence A133419 A133420 A133421`
	KEYWORD	`nonn,word,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Nov 27 2007`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research