A080038 Start with a(1)=3; apply 3 -> 343, 4 -> 3443; iterate.

3, 3, 4, 3, 3, 4, 3, 3, 4, 4, 3, 3, 4, 3, 3, 4, 3, 3, 4, 4, 3, 3, 4, 3, 3, 4, 3, 3, 4, 4, 3, 3, 4, 4, 3, 3, 4, 3, 3, 4, 3, 3, 4, 4, 3, 3, 4, 3, 3, 4, 3, 3, 4, 4, 3, 3, 4, 3, 3, 4, 3, 3, 4, 4, 3, 3, 4, 4, 3, 3, 4, 3, 3, 4, 3, 3, 4, 4, 3, 3, 4, 3, 3, 4, 3, 3, 4, 4, 3, 3, 4, 3, 3, 4, 3, 3, 4, 4, 3, 3, 4, 4, 3, 3, 4

Offset: 1

Author

Matthew Vandermast, Mar 14 2003

Keywords

• easy
• nonn

Comments

a(n)= A080753(n+1) - A080753(n). Sum of first n terms + 2 = A080753(n).

Examples

			3 -> 343 -> 3433443343 -> ...
		

Crossrefs

Cf. A079000, A079948.

Programs

Mathematica

SubstitutionSystem[{3->{3,4,3},4->{3,4,4,3}},{3},{5}][[1]] (* Harvey P. Dale, Jan 01 2024 *)