a1=n,
at=at-1+[the largest digit of at-1] for t>1
For example, if n=165 the sequence begins 165, 171, 178, 186, 194, 203, 206, 212, 214, ...
What is the greatest number of successive odd terms that can be found in an add-largest-digit sequence?
|
||
perplexus dot info | ![]() |
|
![]()
|
|||||||||||||||||||||