This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A182005 Let s(n) = s_3(n) be digit sum of n in base 3. Consider iterations: a_1(n) = s(2^n), a_2(n) = s(2^n+a_1(n)),a_3(n)=s(2^n+a_2(n)),...The sequence lists those n for which these iterations are (eventually) periodic with period > 1. 1
 5, 7, 8, 17, 21, 23, 26, 31, 39, 40, 41, 45, 49, 51, 52, 53, 58, 62, 64, 67, 69, 78, 81, 82, 84, 87, 91, 93, 108, 113, 115, 116, 119, 121, 122, 128, 131, 135, 136, 139, 142, 151, 152, 155, 163, 170, 173, 174, 178, 181, 191, 193, 195, 198, 201 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS For every number n which is not in the sequences, there exists N=N(n) such that, for k>N, a_k(n)=constant(k). LINKS FORMULA Enlarged on 1 numbers which are not in A169655. CROSSREFS Cf. A053735, A000079. Sequence in context: A238011 A140237 A032683 * A192285 A192123 A104423 Adjacent sequences:  A182002 A182003 A182004 * A182006 A182007 A182008 KEYWORD nonn,base AUTHOR Vladimir Shevelev and Peter J. C. Moses, Apr 06 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 18 02:23 EDT 2019. Contains 328135 sequences. (Running on oeis4.)