login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126593 Numbers that belong to a cycle under the map k = Sum d_i 10^i -> f(k) = Sum d_i 2^i. 0
5, 6, 12, 20, 24, 32, 64, 69, 70, 80, 82, 98, 129, 148, 162, 164, 224, 257, 260, 274, 288, 290, 448, 516, 517, 518, 576, 768 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Obviously f(k) < k for k more than 3000. The Mathematica program below calculates f applied hundred times for every number up to 3000. After that the manual checking shows that the output is the exact list. There are three cycles. First: 70, 129, 518, 290, 517, 162. Second: 5, 32, 12, 6, 64, 80, 257, 164, 82, 260, 69, 576, 224, 24, 20. Third: 98, 768, 448, 288, 516.

LINKS

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

EXAMPLE

f(70) = 2^7 + 2^0 = 129, f(129) = 2^1 + 2^2 + 2^9 = 518, f(518) = 2^5 + 2^1 + 2^8 = 290, f(290) = 2^2 + 2^9 + 2^0 = 517, f(517) = 2^5 + 2^1 + 2^7 = 162, f(162) = 2^1 + 2^6 + 2^2 = 70. That means that all the numbers 70, 129, 518, 290, 517, 162 belong to this sequence.

MATHEMATICA

s2p[n_] := Plus @@ (2^IntegerDigits[n]); Union[Table[Nest[s2p, n, 100], {n, 3000}]]

CROSSREFS

Sequence in context: A168145 A276407 A022310 * A302300 A173074 A099473

Adjacent sequences:  A126590 A126591 A126592 * A126594 A126595 A126596

KEYWORD

base,fini,full,nonn

AUTHOR

Tanya Khovanova, Jan 05 2007

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 07:31 EST 2019. Contains 329948 sequences. (Running on oeis4.)