A052218 -id:A052218 - cp's OEIS frontend

A062339 Primes whose sum of digits is 4.

13, 31, 103, 211, 1021, 1201, 2011, 3001, 10111, 20011, 20101, 21001, 100003, 102001, 1000003, 1011001, 1020001, 1100101, 2100001, 10010101, 10100011, 20001001, 30000001, 101001001, 200001001, 1000000021, 1000001011, 1000010101, 1000020001, 1000200001, 1002000001, 1010000011

Offset: 1

Amarnath Murthy, Jun 21 2001

Is this sequence (and its brothers A062337, A062341 and A062343) infinite?

10^A049054(m)+3 and 3*10^A056807(m)+1 are subsequences. A107715 (primes containing only digits from set {0,1,2,3}) is a supersequence. Terms not containing the digit 3 are either terms of A020449 (primes that contain digits 0 and 1 only) or of A106100 (primes with maximal digit 2) - and thus terms of these sequences' union A036953 (primes containing only digits from set {0,1,2}). - Rick L. Shepherd, May 23 2005

			3001 is a prime with sum of digits = 4, hence belongs to the sequence.

T. D. Noe and Robert Israel, Table of n, a(n) for n = 1..10000 (n = 1..1000 from T. D. Noe)
Amin Witno, Numbers which factor as their digital sum times a prime, International Journal of Open Problems in Computer Science and Mathematics 3:2 (2010), pp. 132-136.

Subsequence of A062338, A107288, and A107715 (primes with digits <= 3).
A159352 is a subsequence.
Cf. A000040 (primes), A052218 (digit sum = 4), A061239 (primes == 4 (mod 9)).
Cf. Primes p with digital sum equal to k: {2, 11 and 101} for k=2; this sequence (k=4), A062341 (k=5), A062337 (k=7), A062343 (k=8), A107579 (k=10), A106754 (k=11), A106755 (k=13), A106756 (k=14), A106757 (k=16), A106758 (k=17), A106759 (k=19), A106760 (k=20), A106761 (k=22), A106762 (k=23), A106763 (k=25), A106764 (k=26), A048517 (k=28), A106766 (k=29), A106767 (k=31), A106768 (k=32), A106769 (k=34), A106770 (k=35), A106771 (k=37), A106772 (k=38), A106773 (k=40), A106774 (k=41), A106775 (k=43), A106776 (k=44), A106777 (k=46), A106778 (k=47), A106779 (k=49), A106780 (k=50), A106781 (k=52), A106782 (k=53), A106783 (k=55), A106784 (k=56), A106785 (k=58), A106786 (k=59), A106787 (k=61), A107617 (k=62), A107618 (k=64), A107619 (k=65), A106807 (k=67), A244918 (k=68), A181321 (k=70).
Cf. A049054 (10^k+3 is prime), A159352 (these primes).
Cf. A056807 (3*10^k+1 is prime), A259866 (these primes).
Cf. A020449 (primes with digits 0 and 1), A036953 (primes with digits <= 2), A106100 (primes with largest digit = 2), A069663, A069664 (smallest resp. largest n-digit prime with minimum digit sum).

[p: p in PrimesUpTo(800000000) | &+Intseq(p) eq 4]; // Vincenzo Librandi, Jul 08 2014

N:= 20: # to get all terms < 10^N
B[1]:= {1}:
B[2]:= {2}:
B[3]:= {3}:
A:= {}:
for d from 2 to N do
   B[4]:= map(t -> 10*t+1,B[3]) union  map(t -> 10*t+3,B[1]);
   B[3]:= map(t -> 10*t, B[3]) union map(t -> 10*t+1,B[2]) union map(t -> 10*t+2,B[1]);
   B[2]:= map(t -> 10*t, B[2]) union map(t -> 10*t+1,B[1]);
   B[1]:= map(t -> 10*t, B[1]);
   A:= A union select(isprime,B[4]);
od:
sort(convert(A,list)); # Robert Israel, Dec 28 2015

Union[FromDigits/@Select[Flatten[Table[Tuples[{0,1,2,3},k],{k,9}],1],PrimeQ[FromDigits[#]]&&Total[#]==4&]] (* Jayanta Basu, May 19 2013 *)
FromDigits/@Select[Tuples[{0,1,2,3},10],Total[#]==4&&PrimeQ[FromDigits[#]]&] (* Harvey P. Dale, Jul 23 2025 *)

for(a=1,20,for(b=0,a,for(c=0,b,if(isprime(k=10^a+10^b+10^c+1),print1(k", "))))) \\ Charles R Greathouse IV, Jul 26 2011

select( {is_A062339(p,s=4)=sumdigits(p)==s&&isprime(p)}, primes([1,10^7])) \\ 2nd optional parameter for similar sequences with other digit sums. M. F. Hasler, Mar 09 2022

A062339_upto_length(L,s=4,a=List(),u=[10^(L-k)|k<-[1..L]])=forvec(d=[[1,L]|i<-[1..s]], isprime(p=vecsum(vecextract(u,d))) && listput(a,p),1); Vecrev(a) \\ M. F. Hasler, Mar 09 2022

Intersection of A052218 (digit sum 4) and A000040 (primes). - M. F. Hasler, Mar 09 2022

Corrected and extended by Larry Reeves (larryr(AT)acm.org), Jul 06 2001
More terms from Rick L. Shepherd, May 23 2005
More terms from Lekraj Beedassy, Dec 19 2007

A242614 Triangle read by rows: row n contains numbers with sum of digits = n, and not greater than the n-th repunit (cf. A007953 and A002275).

Original entry on oeis.org

0, 1, 2, 11, 3, 12, 21, 30, 102, 111, 4, 13, 22, 31, 40, 103, 112, 121, 130, 202, 211, 220, 301, 310, 400, 1003, 1012, 1021, 1030, 1102, 1111, 5, 14, 23, 32, 41, 50, 104, 113, 122, 131, 140, 203, 212, 221, 230, 302, 311, 320, 401, 410, 500, 1004, 1013, 1022

Offset: 0

Reinhard Zumkeller, Jul 16 2014

Number of terms in row n = A242622(n);
T(n,1) = A051885(n);
T(n,A242622(n)) = A002275(n);
for n > 0: number of repdigit terms in row n = A242627(n).

			The triangle begins:
. 0:  0
. 1:  1
. 2:  2,11
. 3:  3,12,21,30,102,111
. 4:  4,13,22,31,40,103,112,121,130,202, . . . ,1021,1030,1102,1111
. 5:  5,14,23,32,41,50,104,113,122,131, . . . ,11021,11030,11102,11111 .

Reinhard Zumkeller, Rows n = 0..8 of table, flattened

Cf. A007953 (sum of digits), A002275 (repunits).

Cf. A011557, A052216, A052217, A052218, A052219, A052220, A052221, A052222, A052223, A052224, A166311, A235151, A143164, A235225, A235226, A235227, A166370, A235228, A166459, A235229.

a242614 n k = a242614_row n !! (k-1)
a242614_row n = filter ((== n) . a007953) [n .. a002275 n]
a242614_tabf = map a242614_row [0..]

Join[{0},Flatten[Table[Select[Range[FromDigits[PadRight[{},n,1]]], Total[ IntegerDigits[ #]] == n&],{n,5}]]] (* Harvey P. Dale, Oct 08 2019 *)

A071817 Number of 3-digit numbers whose digits add up to n.

Original entry on oeis.org

1, 3, 6, 10, 15, 21, 28, 36, 45, 54, 61, 66, 69, 70, 69, 66, 61, 54, 45, 36, 28, 21, 15, 10, 6, 3, 1

Offset: 1

Graeme McRae, Jun 07 2002

The sequence as a whole is palindromic; a(n) = a(28-n). - Jon E. Schoenfield, Nov 19 2016

			a(4) = 10 because there are 10 different 3-digit numbers whose digit sum is 4 (103, 112, 121, 130, 202, 211, 220, 301, 310, 400, which are the 3-digit elements of A052218).

Cf. A071816.

for i from 1 to 9*3 do a[i] := 0:od:for i from 100 to 999 dob := convert(i,base,10): s := sum(b[j],j=1..nops(b)):a[s] := a[s]+1:od:seq(a[j],j=1..3*9);

G.f.: (1 - x^10)^2*(x - x^10)/(1 - x)^3. - Miquel Cerda, Jul 09 2017

Corrected and extended by Sascha Kurz, Feb 07 2003

Name clarified by Jon E. Schoenfield, Nov 20 2016

A279769 Numbers n such that the sum of digits of 9n is 18.

Original entry on oeis.org

11, 21, 22, 31, 32, 33, 41, 42, 43, 44, 51, 52, 53, 54, 55, 61, 62, 63, 64, 65, 66, 71, 72, 73, 74, 75, 76, 77, 81, 82, 83, 84, 85, 86, 87, 88, 91, 92, 93, 94, 95, 96, 97, 98, 99, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 121, 122, 131, 132, 133, 141

Offset: 1

M. F. Hasler, Dec 18 2016

Differs from A084854 from a(55) = 110 on.
Numbers n such that A008591(n) is a term of A235228. - Felix Fröhlich, Dec 18 2016
The digital sum of 9n is always a multiple of 9, and never zero. For most numbers < 100, the digital sum is equal to 9, but for example in the range [91..110] all numbers except 100 have their digital sum equal to 18. The b-file / graph gives a hint on the "asymptotic" distribution / density of this set. After a "flat" range like that at [91..110] there comes a record gap. Sizes [and upper ends] of record gaps are: 10 [a(2) = 21], 11 [a(56) = 121, a(119) = 231, a(188) = 341, ..., a(553) = 891, a(616) = 1001], 21 [a(671) = 1121], 31 [a(1331) = 2231], ..., 91 [a(4339) = 8891], 101 [a(4621) = 10001], 121 [a(4841) = 11121], 231 [a(9176) = 22231], ..., 891 [a(24217) = 88891], 1001 [a(25213) = 100001], 1121 [a(25928) = 111121], 2231 [a(47510) = 222231], ..., 8891 [a(108577) = 888891], 10001 [a(111574) = 1000001], 11121 [a(113576) = 1111121], 22231 [a(202511) = 2222231], ..., 88891 [a(416215) = 8888891], ... - M. F. Hasler, Dec 22 2016

M. F. Hasler, Table of n, a(n) for n = 1..25212

Cf. A007953 (digital sum), A008591, A084854.
Cf. 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@ 141, Total@ IntegerDigits[9 #] == 18 &]

is(n) = sumdigits(9*n)==18 \\ Felix Fröhlich, Dec 18 2016

a(n) = A235228(n)/9.

A279777 Numbers k such that the sum of digits of 9k is 27.

Original entry on oeis.org

111, 211, 221, 222, 311, 321, 322, 331, 332, 333, 411, 421, 422, 431, 432, 433, 441, 442, 443, 444, 511, 521, 522, 531, 532, 533, 541, 542, 543, 544, 551, 552, 553, 554, 555, 611, 621, 622, 631, 632, 633, 641, 642, 643, 644, 651, 652, 653, 654, 655, 661

Offset: 1

M. F. Hasler, Dec 23 2016

The digital sum of 9k is always a multiple of 9. For most numbers below 100 it is actually equal to 9. Numbers such that the digital sum of 9k is 18 are listed in A279769. Only every third term of the present sequence is divisible by 3.

The sequence of record gaps [and upper end of the gap] is: 100 [a(2) = 211], 101 [a(221) = 1211], 111 [a(4841) = 11211], 111 [a(10121) = 22311], 111 [a(15752) = 33411], ..., 111 [a(45133) = 88911], 111 [a(50413) = 100011], 211 [a(55253) = 111211], 311 [a(110000) = 222311], ..., 911 [a(380557) = 888911], 1011 [a(411049) = 1000011], 1211 [a(436976) = 1111211], 2311 [a(840281) = 2222311], ..., 8911 [a(2451241) = 8888911], ...

Cf. A008591, A084854, A003991, A004247, A279769 (sumdigits(9n) = 18).
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.
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).
Cf. A007953 (digital sum), A005349 (Niven or Harshad numbers), A245062 (arranged in rows by digit sums).
Cf. A082259.

Select[Range@ 661, Total@ IntegerDigits[9 #] == 27 &] (* Michael De Vlieger, Dec 23 2016 *)

PARI
```
is(n)=sumdigits(9*n)==27
```

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

Original entry on oeis.org

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

A069523 Smallest multiple of n with digit sum = 4, or 0 if no such number exists, e.g. a(3k)= 0.

Original entry on oeis.org

4, 4, 0, 4, 40, 0, 112, 40, 0, 40, 22, 0, 13, 112, 0, 112, 1003, 0, 1102, 40, 0, 22, 1012, 0, 400, 130, 0, 112, 1102, 0, 31, 1120, 0, 10030, 1120, 0, 0, 1102, 0, 40, 0, 0, 301, 220, 0, 1012, 300001, 0, 120001, 400, 0, 1300, 1001011, 0, 220, 112, 0, 1102, 1003, 0

Offset: 1

Amarnath Murthy, Apr 01 2002

a(3k)=a(37k)=a(41k)=0. - Ray Chandler, Jul 30 2003

Cf. A052218, A069521, A069522.

a(n) = n*A088393(n). - R. J. Mathar, Aug 06 2019

More terms from Ray Chandler, Jul 30 2003

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])

cp's OEIS Frontend

A062339 Primes whose sum of digits is 4.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

PARI

Formula

Extensions

A242614 Triangle read by rows: row n contains numbers with sum of digits = n, and not greater than the n-th repunit (cf. A007953 and A002275).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

A071817 Number of 3-digit numbers whose digits add up to n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Maple

Formula

Extensions

A279769 Numbers n such that the sum of digits of 9n is 18.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A279777 Numbers k such that the sum of digits of 9k is 27.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

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