|
| |
|
|
A135499
|
|
Numbers for which Sum_digits(odd positions)=Sum_digits(even positions).
|
|
1
| |
|
|
11, 22, 33, 44, 55, 66, 77, 88, 99, 110, 121, 132, 143, 154, 165, 176, 187, 198, 220, 231, 242, 253, 264, 275, 286, 297, 330, 341, 352, 363, 374, 385, 396, 440, 451, 462, 473, 484, 495, 550, 561, 572, 583, 594, 660, 671, 682, 693, 770, 781, 792, 880, 891, 990
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Conjecture: this is a subset of A008593 (verified for the first 50 thousand terms). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 10 2008
Subset of A008593 - Zak Seidov (zakseidov(AT)yahoo.com) Feb 11 2008.
|
|
|
LINKS
| Paolo P. Lava & Giorgio Balzarotti (paoloplava(AT)gmail.com), Feb 08 2008, Table of n, a(n) for n = 1..119
|
|
|
EXAMPLE
| 594 -> 4+5=9
1023 -> 3+0=2+1
1397 -> 7+3=9+1
|
|
|
MAPLE
| P:=proc(n) local i, k, w, x; for i from 1 by 1 to n do w:=0; k:=i; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; x:=0; k:=i; while k>0 do x:=x+(k-(trunc(k/10)*10)); k:=trunc(k/100); od; if w=2*x then print(i); fi; od; end: P(3000);
|
|
|
MATHEMATICA
| dQ[n_]:=Module[{p=Transpose[Partition[IntegerDigits[n], 2, 2, 1, 0]]}, Total[First[p]]== Total[Last[p]]]; Select[Range[1000], dQ] (* From Harvey P. Dale, May 26 2011 *)
|
|
|
CROSSREFS
| Sequence in context: A048841 A059632 A008593 * A080195 A004920 A136613
Adjacent sequences: A135496 A135497 A135498 * A135500 A135501 A135502
|
|
|
KEYWORD
| easy,nonn,base
|
|
|
AUTHOR
| Paolo P. Lava & Giorgio Balzarotti (paoloplava(AT)gmail.com), Feb 08 2008
|
| |
|
|
