login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A269316 Intersection of A269315 and A269314. 1
15, 24, 30, 258, 372, 645, 2076, 2268, 2385, 2505, 3045, 3090, 3120, 3336, 3366, 3450, 3555, 3678, 4122, 4143, 4233, 4302, 4497, 5118, 5202, 5586, 6717, 6855, 7662, 7731, 8082, 8130, 8340, 9177, 9648, 9759, 9795, 10080, 10242, 10545, 10830, 10926, 11001, 11130 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
All terms are multiple of 3.
LINKS
EXAMPLE
15 = 1+4 + 1+3 + 1+2 + 1+1 + 1+0 = 1+6 + 1+7;
24 = 2+3 + 2+2 + 2+1 + 2+0 + 1+9 = 2+5 + 2+6 + 2+7;
30 = 2+9 + 2+8 + 2+7 = 3+1 + 3+2 + 3+3 + 3+4 + 3+5.
MAPLE
P:= proc(q) local a, b, c, k, n; for n from 1 to q do a:=0; b:=0;
while a<n do b:=b+1; c:=n-b; for k from 1 to ilog10(n-b)+1 do a:=a+(c mod 10); c:=trunc(c/10); od; od;
if a=n then a:=0; b:=0;
while a<n do b:=b+1; c:=n+b; for k from 1 to ilog10(n+b)+1 do a:=a+(c mod 10); c:=trunc(c/10); od; od;
if a=n then print(n); fi; fi; od; end: P(10^6);
MATHEMATICA
A269314 = Select[Range[11130], (x = # + 1; s = Total[IntegerDigits[x]]; While[s < #, x++; s += Total[IntegerDigits[x]]]; s == #) &];
A269315 = Select[Range[3, 11130], (x = # - 1; s = Total[IntegerDigits[x]]; While[s < #, x--; s += Total[IntegerDigits[x]]]; s == #) &];
Intersection[A269314, A269315] (* Robert Price, May 22 2019 *)
CROSSREFS
Sequence in context: A173035 A242152 A269314 * A081829 A348730 A079721
KEYWORD
nonn,base,easy
AUTHOR
Paolo P. Lava, Feb 25 2016
EXTENSIONS
Name corrected by Robert Price, May 22 2019
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)