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!)
A230354 Even numbers n such that digit sum of n = digit sum of largest odd divisor of n. 3
12, 18, 36, 54, 60, 72, 90, 108, 126, 132, 144, 156, 162, 180, 198, 204, 216, 228, 234, 240, 252, 270, 276, 306, 320, 324, 342, 348, 360, 372, 378, 396, 414, 420, 432, 450, 504, 516, 522, 540, 558, 594, 612, 624, 630, 636, 660, 702, 708, 720, 732, 738, 756, 774, 780, 792, 810, 900 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

EXAMPLE

Largest odd divisor of 162 is 81. Digit_sum(162)=9, digit_sum(81)=9

PROG

(PARI)

mdi(n)= n / 2^valuation(n, 2)

digsum(n)={local (d, p); d=0; p=n; while(p, d+=p%10; p=floor(p/10)); return(d)}

{for (n=2, 10^3, m=mdi(n); if(digsum(n)==digsum(mdi(n))&&m<>n, print(n))); }

CROSSREFS

Cf. A006753, A219340, A230355, A230356, A230357.

Sequence in context: A079479 A293692 A162694 * A197464 A124205 A133403

Adjacent sequences:  A230351 A230352 A230353 * A230355 A230356 A230357

KEYWORD

nonn,base,less

AUTHOR

Antonio Roldán, Oct 16 2013

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 7 00:36 EST 2019. Contains 329812 sequences. (Running on oeis4.)