|
Search: id:A135210
|
|
|
| A135210 |
|
Numbers n such that Sum_digits(n)+Sum_digits(n+1)=Sum_digits(n+n+1). |
|
+0
3
|
|
| 0, 1, 2, 3, 4, 9, 10, 11, 12, 13, 14, 19, 20, 21, 22, 23, 24, 29, 30, 31, 32, 33, 34, 39, 40, 41, 42, 43, 44, 49, 99, 100, 101, 102, 103, 104, 109, 110, 111, 112, 113, 114, 119, 120, 121, 122, 123, 124, 129, 130, 131, 132, 133, 134, 139, 140, 141, 142, 143, 144, 149
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
EXAMPLE
|
n=19 -> Sum_digits(19)=10; Sum_digits(20)=2 -> 10+2=12; Sum_digits(19+20)=12
|
|
MAPLE
|
P:=proc(n) local a, b, i, k, w, y, x; for i from 0 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+1; while k>0 do x:=x+k-(trunc(k/10)*10); k:=trunc(k/10); od; y:=0; k:=2*i+1; while k>0 do y:=y+k-(trunc(k/10)*10); k:=trunc(k/10); od; if w+x=y then print(i); fi; od; end: P(1000);
|
|
CROSSREFS
|
Cf. A127273.
Sequence in context: A095260 A113234 A140238 this_sequence A037468 A047454 A081870
Adjacent sequences: A135207 A135208 A135209 this_sequence A135211 A135212 A135213
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Dec 18 2007
|
|
|
Search completed in 0.002 seconds
|
