A052217 -id:A052217 - cp's OEIS frontend

A279768 Numbers n such that the sum of digits of 8n equals 16.

11, 47, 56, 74, 83, 92, 101, 110, 119, 137, 146, 173, 182, 191, 209, 218, 227, 245, 272, 281, 299, 308, 317, 326, 335, 344, 353, 398, 407, 416, 434, 443, 452, 470, 479, 488, 506, 524, 533, 542, 551, 560, 569, 578, 605, 614, 632, 641, 659, 668, 677, 695

Offset: 1

M. F. Hasler, Dec 23 2016

Inspired by A088410 = A069543/8 and A279769 (the analog for 9).

Cf. A007953 (digital sum), A279772 (sumdigits(2n) = 4), A279773 (sumdigits(3n) = 6), A279774 (sumdigits(4n) = 8), A279775 (sumdigits(5n) = 10), A279776 (sumdigits(6n) = 12), A279770 (sumdigits(7n) = 14), A279768 (sumdigits(8n) = 16), A279769 (sumdigits(9n) = 18), A279777 (sumdigits(9n) = 27).
Digital sum of m*n equals m: A088404 = A069537/2, A088405 = A052217/3, A088406 = A063997/4, A088407 = A069540/5, A088408 = A062768/6, A088409 = A063416/7, A088410 = A069543/8.
Cf. A005349 (Niven or Harshad numbers), A245062 (arranged in rows by digit sums).
Numbers with given digital sum: A011557 (1), A052216 (2), A052217 (3), A052218 (4), A052219 (5), A052220 (6), A052221 (7), A052222 (8), A052223 (9), A052224 (10), A166311 (11), A235151 (12), A143164 (13), A235225 (14), A235226 (15), A235227 (16), A166370 (17), A235228 (18), A166459 (19), A235229 (20).

Select[Range@ 700, Total@ IntegerDigits[8 #] == 16 &] (* Michael De Vlieger, Dec 23 2016 *)

PARI
```
is(n)=sumdigits(8*n)==16
```

A279775 Numbers k such that the sum of digits of 5k equals 10.

Original entry on oeis.org

11, 29, 38, 47, 56, 65, 74, 83, 92, 101, 110, 128, 146, 164, 182, 209, 218, 227, 236, 245, 254, 263, 272, 281, 290, 308, 326, 344, 362, 380, 407, 416, 425, 434, 443, 452, 461, 470, 488, 506, 524, 542, 560, 605, 614, 623, 632, 641, 650, 668, 686, 704, 722, 740, 803, 812, 821, 830, 848, 866, 884, 902, 920

Offset: 1

M. F. Hasler, Dec 23 2016

Inspired by A088407 = A069540/5 and A279769 (the analog for 9).

Michael S. Branicky, Table of n, a(n) for n = 1..10000

Cf. A007953 (digital sum), A279772 (sumdigits(2n) = 4), A279773 (sumdigits(3n) = 6), A279774 (sumdigits(4n) = 8), A279776 (sumdigits(6n) = 12), A279770 (sumdigits(7n) = 14), A279768 (sumdigits(8n) = 16), A279769 (sumdigits(9n) = 18), A279777 (sumdigits(9n) = 27).
Digital sum of m*n equals m: A088404 = A069537/2, A088405 = A052217/3, A088406 = A063997/4, A088407 = A069540/5, A088408 = A062768/6, A088409 = A063416/7, A088410 = A069543/8.
Cf. A005349 (Niven or Harshad numbers), A245062 (arranged in rows by digit sums).
Numbers with given digital sum: A011557 (1), A052216 (2), A052217 (3), A052218 (4), A052219 (5), A052220 (6), A052221 (7), A052222 (8), A052223 (9), A052224 (10), A166311 (11), A235151 (12), A143164 (13), A235225 (14), A235226 (15), A235227 (16), A166370 (17), A235228 (18), A166459 (19), A235229 (20).

Select[Range@ 920, Total@ IntegerDigits[5 #] == 10 &] (* Michael De Vlieger, Dec 23 2016 *)

select( is(n)=sumdigits(5*n)==10, [0..999])

def ok(n): return sum(map(int, str(5*n))) == 10
print([k for k in range(921) if ok(k)]) # Michael S. Branicky, Nov 29 2021

A068127 Triangular numbers with sum of digits = 3.

Original entry on oeis.org

3, 21, 120, 210, 300, 10011, 20100, 2001000, 200010000, 20000100000, 2000001000000, 200000010000000, 20000000100000000, 2000000001000000000, 200000000010000000000, 20000000000100000000000, 2000000000001000000000000, 200000000000010000000000000, 20000000000000100000000000000

Offset: 1

Amarnath Murthy, Feb 21 2002

The sequence is unbounded, as the (2*10^k)-th triangular number is a term.

Michael S. Branicky, Table of n, a(n) for n = 1..504

Cf. A000217, A004157, A052217.

t = {}; Do[tri = n*(n+1)/2; If[Total[IntegerDigits[tri, 10]] == 3, AppendTo[t, tri]], {n, 1000000}]; t (* T. D. Noe, Jun 05 2012 *)
Select[Accumulate[Range[2*10^6]],Total[IntegerDigits[#]]==3&] (* Harvey P. Dale, Jun 22 2021 *)
Sort @ Select[Plus @@@ (10^Select[Tuples[Range[0, 29], 3], Min[Differences[#]] >= 0 &]), IntegerQ[Sqrt[8*# + 1]] &] (* Amiram Eldar, May 19 2022 *)

from math import isqrt
from itertools import count, islice
def istri(n): return (lambda x: x == isqrt(x)**2)(8*n+1)
def agen(): yield from filter(istri, (10**i + 10**j + 10**k for i in count(0) for j in range(i+1) for k in range(j+1)))
print(list(islice(agen(), 20))) # Michael S. Branicky, May 14 2022

More terms from Sascha Kurz, Mar 06 2002
One additional term (a(12)) from Harvey P. Dale, May 14 2022
More terms and offset changed to 1 from Michael S. Branicky, May 14 2022

A279770 Numbers n such that the sum of digits of 7n equals 14.

Original entry on oeis.org

11, 38, 47, 56, 65, 74, 83, 92, 101, 110, 119, 155, 164, 182, 191, 209, 218, 236, 245, 263, 272, 299, 308, 317, 326, 335, 344, 353, 362, 380, 389, 416, 434, 452, 461, 470, 479, 488, 506, 515, 533, 560, 578, 587, 596, 605, 623, 632, 650, 659, 686, 722, 731

Offset: 1

M. F. Hasler, Dec 23 2016

Inspired by A088409 = A063416/7 and A279769 (the analog for 9).

Cf. A007953 (digital sum), A279772 (sumdigits(2n) = 4), A279773 (sumdigits(3n) = 6), A279774 (sumdigits(4n) = 8), A279775 (sumdigits(5n) = 10), A279776 (sumdigits(6n) = 12), A279768 (sumdigits(8n) = 16), A279769 (sumdigits(9n) = 18), A279777 (sumdigits(9n) = 27).
Digital sum of m*n equals m: A088404 = A069537/2, A088405 = A052217/3, A088406 = A063997/4, A088407 = A069540/5, A088408 = A062768/6, A088409 = A063416/7, A088410 = A069543/8.
Cf. A005349 (Niven or Harshad numbers), A245062 (arranged in rows by digit sums).
Numbers with given digital sum: A011557 (1), A052216 (2), A052217 (3), A052218 (4), A052219 (5), A052220 (6), A052221 (7), A052222 (8), A052223 (9), A052224 (10), A166311 (11), A235151 (12), A143164 (13), A235225 (14), A235226 (15), A235227 (16), A166370 (17), A235228 (18), A166459 (19), A235229 (20).

Select[Range@ 731, Total@ IntegerDigits[7 #] == 14 &] (* Michael De Vlieger, Dec 23 2016 *)

PARI
```
is(n)=sumdigits(7*n)==14
```

A279772 Numbers n such that the sum of digits of 2n equals 4.

Original entry on oeis.org

2, 11, 20, 56, 65, 101, 110, 155, 200, 506, 515, 551, 560, 605, 650, 1001, 1010, 1055, 1100, 1505, 1550, 2000, 5006, 5015, 5051, 5060, 5105, 5150, 5501, 5510, 5555, 5600, 6005, 6050, 6500, 10001, 10010, 10055, 10100, 10505, 10550, 11000, 15005, 15050, 15500

Offset: 1

M. F. Hasler, Dec 23 2016

Inspired by A088404 = A069537/2 and A279769 (the analog for 9).

Cf. A007953 (digital sum), A052216 (sumdigits(n) = 2), A279773 (sumdigits(3n) = 6), A279774 (sumdigits(4n) = 8), A279775 (sumdigits(5n) = 10), A279776 (sumdigits(6n) = 12), A279770 (sumdigits(7n) = 14), A279768 (sumdigits(8n) = 16), A279769 (sumdigits(9n) = 18), A279777 (sumdigits(9n) = 27).
Digital sum of m*n equals m: A088404 = A069537/2, A088405 = A052217/3, A088406 = A063997/4, A088407 = A069540/5, A088408 = A062768/6, A088409 = A063416/7, A088410 = A069543/8.
Cf. A005349 (Niven or Harshad numbers), A245062 (arranged in rows by digit sums).
Numbers with given digital sum: A011557 (1), A052216 (2), A052217 (3), A052218 (4), A052219 (5), A052220 (6), A052221 (7), A052222 (8), A052223 (9), A052224 (10), A166311 (11), A235151 (12), A143164 (13), A235225 (14), A235226 (15), A235227 (16), A166370 (17), A235228 (18), A166459 (19), A235229 (20).

Select[Range@ 15500, Total@ IntegerDigits[2 #] == 4 &] (* Michael De Vlieger, Dec 23 2016 *)

select( is(n)=sumdigits(2*n)==4, [1..9999])

A279773 Numbers n such that the sum of digits of 3n equals 6.

Original entry on oeis.org

2, 5, 8, 11, 14, 17, 20, 35, 38, 41, 44, 47, 50, 68, 71, 74, 77, 80, 101, 104, 107, 110, 134, 137, 140, 167, 170, 200, 335, 338, 341, 344, 347, 350, 368, 371, 374, 377, 380, 401, 404, 407, 410, 434, 437, 440, 467, 470, 500, 668, 671, 674, 677, 680, 701

Offset: 1

M. F. Hasler, Dec 23 2016

Inspired by A088405 = A052217/3 and A279769 (the analog for 9).

Cf. A007953 (digital sum), A279772 (sumdigits(2n) = 4), A279774 (sumdigits(4n) = 8), A279775 (sumdigits(5n) = 10), A279776 (sumdigits(6n) = 12), A279770 (sumdigits(7n) = 14), A279768 (sumdigits(8n) = 16), A279769 (sumdigits(9n) = 18), A279777 (sumdigits(9n) = 27).
Digital sum of m*n equals m: A088404 = A069537/2, A088405 = A052217/3, A088406 = A063997/4, A088407 = A069540/5, A088408 = A062768/6, A088409 = A063416/7, A088410 = A069543/8.
Cf. A005349 (Niven or Harshad numbers), A245062 (arranged in rows by digit sums).
Numbers with given digital sum: A011557 (1), A052216 (2), A052217 (3), A052218 (4), A052219 (5), A052220 (6), A052221 (7), A052222 (8), A052223 (9), A052224 (10), A166311 (11), A235151 (12), A143164 (13), A235225 (14), A235226 (15), A235227 (16), A166370 (17), A235228 (18), A166459 (19), A235229 (20).

Select[Range@ 720, Total@ IntegerDigits[3 #] == 6 &] (* Michael De Vlieger, Dec 23 2016 *)

select( is(n)=sumdigits(3*n)==6, [1..999])

A279774 Numbers n such that the sum of digits of 4n equals 8.

Original entry on oeis.org

2, 11, 20, 29, 38, 56, 65, 83, 101, 110, 128, 155, 200, 254, 263, 281, 290, 308, 326, 335, 353, 380, 425, 506, 515, 533, 551, 560, 578, 605, 650, 758, 776, 785, 803, 830, 875, 1001, 1010, 1028, 1055, 1100, 1253, 1280, 1325, 1505, 1550, 1775

Offset: 1

M. F. Hasler, Dec 23 2016

Inspired by A088406 = A063997/4 and A279769 (the analog for 9).

Cf. A007953 (digital sum), A279772 (sumdigits(2n) = 4), A279773 (sumdigits(3n) = 6), A279775 (sumdigits(5n) = 10), A279776 (sumdigits(6n) = 12), A279770 (sumdigits(7n) = 14), A279768 (sumdigits(8n) = 16), A279769 (sumdigits(9n) = 18), A279777 (sumdigits(9n) = 27).
Digital sum of m*n equals m: A088404 = A069537/2, A088405 = A052217/3, A088406 = A063997/4, A088407 = A069540/5, A088408 = A062768/6, A088409 = A063416/7, A088410 = A069543/8.
Cf. A005349 (Niven or Harshad numbers), A245062 (arranged in rows by digit sums).
Numbers with given digital sum: A011557 (1), A052216 (2), A052217 (3), A052218 (4), A052219 (5), A052220 (6), A052221 (7), A052222 (8), A052223 (9), A052224 (10), A166311 (11), A235151 (12), A143164 (13), A235225 (14), A235226 (15), A235227 (16), A166370 (17), A235228 (18), A166459 (19), A235229 (20).

Select[Range@ 2000, Total@ IntegerDigits[4 #] == 8 &] (* Michael De Vlieger, Dec 23 2016 *)

select( is(n)=sumdigits(4*n)==8, [1..1999])

A279776 Numbers n such that the sum of digits of 6n equals 12.

Original entry on oeis.org

8, 11, 14, 23, 26, 29, 32, 38, 41, 44, 47, 53, 56, 59, 62, 65, 68, 71, 74, 77, 80, 86, 89, 92, 95, 101, 104, 107, 110, 119, 122, 125, 134, 137, 140, 152, 155, 173, 176, 179, 182, 188, 191, 194, 197, 203, 206, 209, 212, 215, 218, 221, 224, 227, 230, 236

Offset: 1

M. F. Hasler, Dec 23 2016

Inspired by A088408 = A062768/6 and A279769 (the analog for 9).

Cf. A007953 (digital sum), A279772 (sumdigits(2n) = 4), A279773 (sumdigits(3n) = 6), A279774 (sumdigits(4n) = 8), A279775 (sumdigits(5n) = 10), A279770 (sumdigits(7n) = 14), A279768 (sumdigits(8n) = 16), A279769 (sumdigits(9n) = 18), A279777 (sumdigits(9n) = 27).
Digital sum of m*n equals m: A088404 = A069537/2, A088405 = A052217/3, A088406 = A063997/4, A088407 = A069540/5, A088408 = A062768/6, A088409 = A063416/7, A088410 = A069543/8.
Cf. A005349 (Niven or Harshad numbers), A245062 (arranged in rows by digit sums).
Numbers with given digital sum: A011557 (1), A052216 (2), A052217 (3), A052218 (4), A052219 (5), A052220 (6), A052221 (7), A052222 (8), A052223 (9), A052224 (10), A166311 (11), A235151 (12), A143164 (13), A235225 (14), A235226 (15), A235227 (16), A166370 (17), A235228 (18), A166459 (19), A235229 (20).

Select[Range@ 240, Total@ IntegerDigits[6 #] == 12 &] (* Michael De Vlieger, Dec 23 2016 *)

PARI
```
is(n)=sumdigits(6*n)==12
```

A340063 The primes appear in their natural order and the absolute difference between two successive primes is the sum of the digits between them.

Original entry on oeis.org

2, 1, 3, 10, 100, 5, 20, 7, 4, 11, 110, 13, 12, 1000, 17, 200, 19, 21, 10000, 23, 6, 29, 1001, 31, 14, 100000, 37, 22, 41, 1010, 43, 30, 1000000, 47, 15, 53, 24, 59, 1100, 61, 32, 10000000, 67, 40, 71, 2000, 73, 33, 79, 102, 100000000, 83, 42, 89, 8, 97, 111, 1000000000, 101, 10001, 103, 112, 107, 10010, 109

Offset: 1

Eric Angelini, Dec 27 2020

Lexicographically earliest sequence of distinct positive terms with this property. It is conjectured that the sequence is a permutation of the integers > 1.

			prime 2 + (1) = prime 3;
prime 3 + (1+0 + 1+0+0) = prime 5; (we do not put 2 between 5 and 7 as 2 is in the sequence already and not 20 as 10 is lexicographically earlier along with 100 gives the digital sum 2).
prime 5 + (2+0) = prime 7;
prime 7 + (4) = prime 11;
prime 11 + (1+1+0) = prime 13;
prime 13 + (1+2 + 1+0+0+0) = 17; etc.

David A. Corneth, Table of n, a(n) for n = 1..8564 (terms < 10^999; first 515 terms from Carole Dubois)

Cf. A000040 (the prime numbers), A001223 (prime gaps), A052216, A052217.

A375460 Lexicographically earliest sequence of distinct nonnegative terms arranged in successive chunks whose digitsum = 10.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 10, 11, 20, 6, 12, 100, 7, 21, 8, 101, 9, 1000, 13, 14, 10000, 15, 22, 16, 30, 17, 110, 18, 100000, 19, 23, 31, 1000000, 24, 40, 25, 102, 26, 200, 27, 10000000, 28, 32, 41, 33, 103, 34, 111, 35, 1001, 36, 100000000, 37, 42, 112, 43, 120, 44, 1010, 45, 1000000000

Offset: 1

Eric Angelini, Aug 15 2024

The first integer that will never appear in the sequence is 29, as its digitsum exceeds 10.
From Michael S. Branicky, Aug 16 2024: (Start)
Infinite since A052224 is infinite (as are all sequences with digital sum 1..10).
a(6492) has 1001 digits. (End)

			The first chunk of integers with digitsum 10 is (0,1,2,3,4);
the next one is (5,10,11,20),
the next one is (6,12,100),
the next one is (7,21),
the next one is (8,101),
the next one is (9,1000),
the next one is (13,14,10000), etc.
The concatenation of the above chunks produce the sequence.

Michael S. Branicky, Table of n, a(n) for n = 1..6491

Cf. A166311, A051885, A228915.

Numbers with digital sum 1..10: A011557 (1), A052216 (2), A052217 (3), A052218 (4), A052219 (5), A052220 (6), A052221 (7), A052222 (8), A052223 (9), A052224 (10).

from itertools import islice
def bgen(ds): # generator of terms with digital sum ds
    def A051885(n): return ((n%9)+1)*10**(n//9)-1 # due to Chai Wah Wu
    def A228915(n): # due to M. F. Hasler
        p = r = 0
        while True:
            d = n % 10
            if d < 9 and r: return (n+1)*10**p + A051885(r-1)
            n //= 10; r += d; p += 1
    k = A051885(ds)
    while True: yield k; k = A228915(k)
def agen(): # generator of terms
    an, ds_block = 0, 0
    dsg = [None] + [bgen(i) for i in range(1, 11)]
    dsi = [None] + [(next(dsg[i]), i) for i in range(1, 11)]
    while True:
        yield an
        an, ds_an = min(dsi[j] for j in range(1, 11-ds_block))
        ds_block = (ds_block + ds_an)%10
        dsi[ds_an] = (next(dsg[ds_an]), ds_an)
print(list(islice(agen(), 61))) # Michael S. Branicky, Aug 16 2024

a(46) and beyond from Michael S. Branicky, Aug 16 2024.

cp's OEIS Frontend

A279768 Numbers n such that the sum of digits of 8n equals 16.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

A279775 Numbers k such that the sum of digits of 5k equals 10.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

A068127 Triangular numbers with sum of digits = 3.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Python

Extensions

A279770 Numbers n such that the sum of digits of 7n equals 14.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

A279772 Numbers n such that the sum of digits of 2n equals 4.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

A279773 Numbers n such that the sum of digits of 3n equals 6.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

A279774 Numbers n such that the sum of digits of 4n equals 8.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

A279776 Numbers n such that the sum of digits of 6n equals 12.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

A340063 The primes appear in their natural order and the absolute difference between two successive primes is the sum of the digits between them.

Views

Author