A081261 Start with a(1)=4; apply 4 -> 665, 5 -> 56665, 6 -> 566665; iterate.

4, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 5, 5, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 5, 5, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 5, 5, 6, 6, 6, 5, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6

Offset

1,1

Comments

a(n)= A081260(n) - A081260(n-1) (taking A081260(0) as equal to 0). Sum of first n terms = A081260(n).

Links

Table of n, a(n) for n=1..105.

Example

4 -> 665 -> 56666556666556665 -> ...

Crossrefs

Cf. A079000, A079948.

Sequence in context: A146208 A011227 A155907 * A251738 A249022 A270541

Adjacent sequences: A081258 A081259 A081260 * A081262 A081263 A081264

Keyword

easy,nonn

Author

Matthew Vandermast, Mar 14 2003

Status

approved