A230093 -id:A230093 - cp's OEIS frontend

A230094 Numbers that can be expressed as (m + sum of digits of m) in exactly two ways.

101, 103, 105, 107, 109, 111, 113, 115, 117, 202, 204, 206, 208, 210, 212, 214, 216, 218, 303, 305, 307, 309, 311, 313, 315, 317, 319, 404, 406, 408, 410, 412, 414, 416, 418, 420, 505, 507, 509, 511, 513, 515, 517, 519, 521, 606, 608, 610, 612, 614, 616, 618, 620, 622, 707, 709, 711, 713, 715, 717, 719, 721, 723, 808

Offset: 1

N. J. A. Sloane, Oct 10 2013, Oct 24 2013

Numbers n such that A230093(n) = 2.
The sequence "Numbers n such that A230093(n) = 3" starts at 10^13+1 (see A230092). This implies that changing the definition of A230094 to "Numbers n such that A230093(n) >= 2" (the so-called "junction numbers") would produce a sequence which agrees with A230094 up to 10^13.
Makowski shows that the sequence of junction numbers is infinite.

			a(1) = 101 = 91 + (9+1) = 100 + (1+0+0);
a(10) = 202 = 191 + (1+9+1) = 200 + (2+0+0);
a(100) = 1106 = 1093 + (1+0+9+3) = 1102 + (1+1+0+2);
a(1000) = 10312 = 10295 + (1+0+2+9+5) = 10304 + (1+0+3+0+4).

Joshi, V. S. A note on self-numbers. Volume dedicated to the memory of V. Ramaswami Aiyar. Math. Student 39 (1971), 327--328 (1972). MR0330032 (48 #8371)
D. R. Kaprekar, Puzzles of the Self-Numbers. 311 Devlali Camp, Devlali, India, 1959.
D. R. Kaprekar, The Mathematics of the New Self Numbers, Privately Printed, 311 Devlali Camp, Devlali, India, 1963.
Makowski, Andrzej. On Kaprekar's "junction numbers''. Math. Student 34 1966 77 (1967). MR0223292 (36 #6340)
Narasinga Rao, A. On a technique for obtaining numbers with a multiplicity of generators. Math. Student 34 1966 79--84 (1967). MR0229573 (37 #5147)

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Max A. Alekseyev and N. J. A. Sloane, On Kaprekar's Junction Numbers, arXiv:2112.14365, 2021; Journal of Combinatorics and Number Theory 12:3 (2022), 115-155.
Santanu Bandyopadhyay, Self-Number, Indian Institute of Technology Bombay (Mumbai, India, 2020).
Santanu Bandyopadhyay, Self-Number, Indian Institute of Technology Bombay (Mumbai, India, 2020). [Local copy]
David A. Corneth, Examples
Shyam Sunder Gupta, On Some Marvellous Numbers of Kaprekar, Exploring the Beauty of Fascinating Numbers, Springer (2025) Ch. 9, 275-315.
D. R. Kaprekar, The Mathematics of the New Self Numbers [annotated and scanned]
Index entries for Colombian or self numbers and related sequences

Cf. A003052, A007953, A004207, A048528, A062028, A176995, A225793, A227915, A230092, A230093.

a230094 n = a230094_list !! (n-1)
a230094_list = filter ((== 2) . a230093) [0..]
-- Reinhard Zumkeller, Oct 11 2013

Maple
```
For Maple code see A230093.
```

Position[#, 2][[All, 1]] - 1 &@ Sort[Join[#2, Map[{#, 0} &, Complement[Range[#1], #2[[All, 1]]]] ] ][[All, -1]] & @@ {#, Tally@ Array[# + Total@ IntegerDigits@ # &, # + 1, 0]} &[10^3] (* Michael De Vlieger, Oct 28 2020, after Harvey P. Dale at A230093 *)

A320878 Primes such that iteration of A062028 (n + its digit sum) yields 6 primes in a row.

Original entry on oeis.org

286330897, 286330943, 388098901, 955201943, 1776186851, 1854778853, 2559495863, 2647782901, 3517793911, 3628857863, 3866728909, 3974453911, 4167637819, 4269837799, 5083007887, 5362197829, 5642510933, 6034811933, 8180784851, 8214319903

Offset: 1

Zak Seidov and M. F. Hasler, Nov 08 2018

In contrast to A048523, ..., A048527, this definition uses "at least" for the number of successive primes. This allows easier computation of subsequences of terms which yield even more primes in a row.

One can nonetheless compute the terms of this sequence by considering possible pre-images under A062028 of terms of A048527. This gives the terms which yield exactly 6 primes in a row (i.e., A320878 \ A320879), and one has to take the union with further iterates of this procedure (which successively yields A320879 \ A320880, etc).

Lars Blomberg, Table of n, a(n) for n = 1..7626 (Terms < 10^14. The first 200 from M. F. Hasler)
Carlos Rivera, Puzzle 163. P+SOD(P)

Cf. A062028 (n + digit sum of n), A047791 (A062028(n) is prime), A048519 (primes among these).
Cf. A048523 .. A048527, A320879.
a(1) = A090009(7) = start of first chain of 7 primes under iteration of A062028.
Cf. A320881, A048520.
Cf. A230093 (number of m s.th. m + (sum of digits of m) = n) and references there.

is_A320878(n,p=n)={for(i=1,6, isprime(p=A062028(p))||return);isprime(n)}
forprime(p=286e6,,is_A320878(p)&& print1(p","))
/* much faster, using the precomputed array A048527, as follows: */
PP(n)=select(p->p+sumdigits(p)==n,primes([n-9*#digits(n),n-2])) \\ Returns list of prime predecessors for A062028. (PP(n) nonempty <=> n in A320881.)
A320878=[]; my(S=A048527); while(#S=Set(concat(apply(PP,S))), A320878=setunion(A320878,S)) \\ Yields 211 terms from A048527[1..3000]

Numbers n in A048519 for which A062028(n) is in A048527, form the subset A320878 \ A320879.

A225793 Numbers n that can be uniquely expressed as (m + sum of digits of m) for some m.

Original entry on oeis.org

2, 4, 6, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 76, 77

Offset: 1

Jayanta Basu, Jul 27 2013

Subset of A176995; first member in A176995 that is not here is 101, next is 103 (cf. A230094).

A230093(a(n)) = 1. - Reinhard Zumkeller, Oct 11 2013

			100 is a member as 100 = 86 + sum of digits of (86). 101 is not a member since both 91 and 100 generate 101. Again 103 is not a member as 92 and 101 generate 103.

Joshi, V. S. A note on self-numbers. Volume dedicated to the memory of V. Ramaswami Aiyar. Math. Student 39 (1971), 327--328 (1972). MR0330032 (48 #8371)
Makowski, Andrzej. On Kaprekar's "junction numbers''. Math. Student 34 1966 77 (1967). MR0223292 (36 #6340)
Narasinga Rao, A. On a technique for obtaining numbers with a multiplicity of generators. Math. Student 34 1966 79--84 (1967). MR0229573 (37 #5147)

Jayanta Basu and Donovan Johnson, Table of n, a(n) for n = 1..10000 (first 1000 terms from Jayanta Basu)
Index entries for Colombian or self numbers and related sequences

Cf. A007953, A062028, A004207, A230093, A003052, A176995, A230094.

a225793 n = a225793_list !! (n-1)
a225793_list = filter ((== 1) . a230093) [1..]
-- Reinhard Zumkeller, Oct 11 2013

For Maple code see A230093. - N. J. A. Sloane, Oct 11 2013

co[n_] := Count[Range[n - 1], _?(# + Total[IntegerDigits[#]] == n &)]; Select[Range[100], co[#] == 1 &]
Select[Tally[Table[m+Total[IntegerDigits[m]],{m,100}]],#[[2]]==1&][[All, 1]]// Sort (* Harvey P. Dale, Aug 23 2017 *)

A336983 Bogota numbers that are not Colombian numbers.

Original entry on oeis.org

4, 11, 16, 24, 25, 36, 39, 49, 56, 81, 88, 93, 96, 111, 119, 138, 144, 164, 171, 192, 224, 242, 250, 297, 336, 339, 366, 393, 408, 422, 448, 456, 488, 497, 516, 520, 522, 564, 575, 696, 704, 744, 755, 777, 792, 795, 819, 848, 884, 900, 912, 933, 944, 966, 992

Offset: 1

Bernard Schott, Aug 10 2020

Equivalently, numbers m that are of the form k + sum of digits of k for some k (A176995), and also of the form q * product of digits of q for some q (A336826).
Repunits are trivially Bogota numbers but the indices m of the repunits R_m that are not Colombian numbers are in A337139; also, all known repunit primes are terms (A004023) [see examples for primes R_2, R_19 and R_23].
35424 is the smallest term that belongs to both A230094 and A336944 (see last example).

			R_2 = 11 = 10 + (1+0) = 11 * (1*1) is a term;
24 = 21 + (2+1) = 12 * (1*2) is a term;
39 = 33 + (3+3) = 13 * (1*3) is a term;
R_19 = 1111111111111111079 + (16*1+7+9) = 1111111111111111111 * (1^19) hence R_19 is a term;
R_23 = 11111111111111111111077 + (20*1+7+7) = 11111111111111111111111 * (1^23) hence R_23 is a term;
42 = 21 * (2*1) is a Bogota number but there does not exist m < 42 such that 42 = m + sum of digits of m, hence 42 that is also a Colombian number is not a term.
35424 = 35406 + (3+5+4+0+6) = 35397 + (3+5+3+9+7) = 2214 * (2*2*1*4) = 492 * (4*9*2).

Giovanni Resta, Self or Colombian number, Numbers Aplenty.
Puzzling Stackexchange, Pairs of Bogotá Numbers.
Index to sequences related to Colombian numbers.

Intersection of A176995 and A336826.
Cf. A003052 (Colombian), A336984 (Bogota and Colombian), A336985 (Colombian not Bogota), A336986 (not Colombian and not Bogota).
Cf. A230093, A230094, A336944, A337139.

m = 1000; Intersection[Select[Union[Table[n + Plus @@ IntegerDigits[n], {n, 1, m}]], # <= m &], Select[Union[Table[n * Times @@ IntegerDigits[n], {n, 1, m}]], # <= m &]] (* Amiram Eldar, Aug 10 2020 *)

lista(nn) = Vec(setintersect(Set(vector(nn, k, k+sumdigits(k))), Set(vector(nn, k, k*vecprod(digits(k)))))); \\ Michel Marcus, Aug 20 2020

A230100 Numbers that can be expressed as (m + sum of digits of m) in exactly three ways.

Original entry on oeis.org

10000000000001, 10000000000003, 10000000000005, 10000000000007, 10000000000009, 10000000000011, 10000000000013, 10000000000015, 10000000000102, 10000000000104, 10000000000106, 10000000000108, 10000000000110, 10000000000112, 10000000000114, 10000000000116

Offset: 1

N. J. A. Sloane, Oct 12 2013 - Oct 25 2013

Let f(n) = n + (sum of digits of n) = A062028(n).
Let g(m) = number of n such that f(n) = m (i.e. the number of inverses of m), A230093(m).
Numbers m with g(m) = 0 are called the Self or Colombian numbers, A003052.
Numbers m with g(m) = 1 give A225793.
Numbers m with g(m) = 2 give A230094.
The present sequence gives numbers m such that A230093(m) = 3.
The smallest term, a(1) = 10^13 + 1, was found by Narasinga Rao, who reports that Kaprekar verified that it is the smallest term. No details of Kaprekar's proof were given.
a(2) onwards were computed by Donovan Johnson, Oct 12 2013, and on Oct 20 2013 he completed a search of all numbers below 10^13 and verified that 10^13 + 1 is indeed the smallest term.
See A006064 for much more about this question.
Numbers m with g(m) = 4 give A377422. - Daniel Mondot, Oct 29 2024

			There are exactly three numbers, 9999999999892, 9999999999901 and 10000000000000, whose image under n->f(n) is 10000000000001, so 10^13+1 is a member of the sequence.

V. S. Joshi, A note on self-numbers. Volume dedicated to the memory of V. Ramaswami Aiyar. Math. Student 39 (1971), 327--328 (1972). MR0330032 (48 #8371)
D. R. Kaprekar, The Mathematics of the New Self Numbers, Privately printed, 311 Devlali Camp, Devlali, India, 1963.
Andrzej Makowski, On Kaprekar's "junction numbers", Math. Student 34 1966 77 (1967). MR0223292 (36 #6340)
A. Narasinga Rao, On a technique for obtaining numbers with a multiplicity of generators, Math. Student 34 1966 79--84 (1967). MR0229573 (37 #5147)

Daniel Mondot, Table of n, a(n) for n = 1..10000
Max A. Alekseyev and N. J. A. Sloane, On Kaprekar's Junction Numbers, arXiv:2112.14365, 2021; Journal of Combinatorics and Number Theory 12:3 (2022), 115-155.
D. R. Kaprekar, The Mathematics of the New Self Numbers [annotated and scanned]
Index entries for Colombian or self numbers and related sequences

Cf. A006064, A062028, A230093.

A247104 Squarefree self-numbers.

Original entry on oeis.org

3, 5, 7, 31, 42, 53, 86, 97, 110, 143, 154, 165, 187, 209, 211, 222, 233, 255, 266, 277, 299, 310, 323, 334, 345, 367, 389, 411, 413, 435, 446, 457, 479, 501, 514, 547, 569, 591, 602, 613, 615, 626, 659, 670, 681, 703, 714, 727, 749, 771, 782, 793, 815, 817

Offset: 1

Reinhard Zumkeller, Nov 18 2014

Squarefree numbers not expressible as the sum of an integer and its digit sum;

intersection of A005117 and A003052.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
D. R. Kaprekar, The Mathematics of the New Self Numbers [annotated and scanned]
Eric Weisstein's World of Mathematics, Self Number
Wikipedia, Self number

Cf. A005117, A003052, A008966, A062028, A006378 (subsequence), A249044.

a247104 n = a247104_list !! (n-1)
a247104_list = filter ((== 1) . a008966) $ tail a003052_list

nmax = 1000;
Select[Complement[Range[nmax], Union[Table[n + Total[IntegerDigits[n]], {n, 1, nmax}]]], #>1 && SquareFreeQ[#]&] (* Jean-François Alcover, Jan 08 2020, after T. D. Noe in A003052 *)

A008966(a(n)) * (1 - A230093(a(n))) = 1.

A358351 Number of values of m such that m + (sum of digits of m) + (product of digits of m) is n.

Original entry on oeis.org

0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 2, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 3, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 2, 0, 0, 1, 1, 1, 1, 0, 2, 0, 0, 0, 2, 1, 0, 0, 1, 0, 2, 1, 0, 0, 0, 1, 2, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 2, 0

Offset: 1

Bernard Schott, Nov 16 2022

a(n) is the number of times n occurs in A161351.

a(n) > 0 iff n is in A358350.

			A161351(15) = 15 + (1+5) + (1*5) = 26 =  21 + (2+1) + (2*1) = A161351(21), so, a(26) = 2.

Cf. A011540, A161351, A358350.

Similar: A230093 (m+digitsum), A230103 (m+digitprod).

f[n_] := n + Total[(d = IntegerDigits[n])] + Times @@ d; With[{m = 100}, BinCounts[Table[f[n], {n, 1, m}], {1, m, 1}]] (* Amiram Eldar, Nov 16 2022 *)

first(n) = {my(res = vector(n)); for(i = 1, n, c = i + sumdigits(i) + vecprod(digits(i)); if(c <= n, res[c]++ ) ); res } \\ David A. Corneth, Nov 16 2022

from itertools import combinations_with_replacement
from math import prod
def A358351(n):
    c = set()
    for l in range(1,len(str(n))+1):
        l1, l2 = 10**l, 10**(l-1)
        for d in combinations_with_replacement(tuple(range(10)),l):
            s, p = sum(d), prod(d)
            if l1>(m:=n-s-p)>=l2 and sorted(int(d) for d in str(m)) == list(d):
                c.add(m)
    return len(c) # Chai Wah Wu, Nov 20 2022

A377422 Numbers that can be expressed as (m + sum of digits of m) in exactly four ways.

Original entry on oeis.org

1000000000000000000000102, 1000000000000000000000104, 1000000000000000000000106, 1000000000000000000000108, 1000000000000000000000110, 1000000000000000000000112, 1000000000000000000000114, 2000000000000000000000103, 2000000000000000000000105, 2000000000000000000000107, 2000000000000000000000109

Offset: 1

Daniel Mondot, Oct 27 2024

Numbers k such that A230093(k) = 0 give A003052, the Self or Colombian numbers.
Numbers k such that A230093(k) = 1 give A225793.
Numbers k such that A230093(k) = 2 give A230094.
Numbers k such that A230093(k) = 3 give A230100.
Numbers k such that A230093(k) = 4 give this sequence.

			There are exactly four numbers, 999999999999999999999894, 999999999999999999999903, 1000000000000000000000092, and 1000000000000000000000101, whose image under n->f(n) is 1000000000000000000000104, so 1000000000000000000000104 is a member of the sequence.

Daniel Mondot, Table of n, a(n) for n = 1..10000
Max A. Alekseyev and N. J. A. Sloane, On Kaprekar's Junction Numbers, arXiv:2112.14365, 2021; Journal of Combinatorics and Number Theory 12:3 (2022), 115-155.

Cf. A230100, A006064, A062028, A230093.

Corrected by Daniel Mondot, Apr 17 2025

A377423 Distinct values of the number of integers between consecutive self numbers (A163139), in order of occurrence.

Original entry on oeis.org

1, 10, 14, 27, 40, 53, 66, 79, 92, 105, 118, 100, 117, 130, 143, 156, 169, 182, 195, 208, 23, 89, 203, 220, 233, 246, 259, 272, 285, 298, 34, 78, 293, 306, 323, 336, 349, 362, 375, 388, 45, 67, 383, 396, 409, 426, 439, 452, 465, 478, 56, 473, 486, 499

Offset: 1

Daniel Mondot, Oct 27 2024

Each new value is typically found between self numbers located around 10^k, for some k.

This sequences exhibits interesting patterns, for instance, many new numbers are 13 apart.

			Between the first 2 self numbers 1 and 3, there is 1 integer. So 1 is in the sequence
The next new gap is between 9 and 20, with 10 integers, so 10 is in the sequence.
The next new gap is between 1006 and 1021, with 14 integers, so 14 is in the sequence.

Daniel Mondot, Table of n, a(n) for n = 1..10000
Daniel Mondot, First self number found after a new gap value

Cf. A003052, A163128, A163139, A225793, A230093, A230094, A377422, A377472, A377473.

a(n) = A377473(n)-1. - Daniel Mondot, Apr 17 2025

A230302 Let M(1)=0 and for n >= 2, let B(n)=M(ceiling(n/2))+M(floor(n/2))+2, M(n)=2^B(n)+M(floor(n/2))+1; sequence gives B(n).

Original entry on oeis.org

2, 7, 12, 136, 260, 4233, 8206, 87112285931760246646623899502532662136846, 174224571863520493293247799005065324265486, 1852673427797059126777135760139006525739432040582009271277945243629142736371850, 3705346855594118253554271520278013051304639509300498049262642688253220148478214

Offset: 2

N. J. A. Sloane, Oct 24 2013

nonn

a(n) is the leading power of 2 in M(n) = A230303(n).

			The terms after 8206 are 2^136+4110, 2^137+14, 2^260+2^136+136, 2^261+262, 2^4233+2^260+260, ... (see also A230303).

Max Alekseyev, Table giving values of n and an expression for a(n) for n=2..100
Max A. Alekseyev and N. J. A. Sloane, On Kaprekar's Junction Numbers, arXiv:2112.14365, 2021; Journal of Combinatorics and Number Theory 12:3 (2022), 115-155.
Index entries for Colombian or self numbers and related sequences

Cf. A228085, A230093, A230303 (for M(n)).

f:=proc(n) option remember; local B, M;
if n<=1 then RETURN([0,0]);
else
if (n mod 2) = 0 then B:=2*f(n/2)[2]+2;
   else B:=f((n+1)/2)[2]+f((n-1)/2)[2]+2; fi;
M:=2^B+f(floor(n/2))[2]+1; RETURN([B,M]); fi;
end proc;
[seq(f(n)[1],n=1..7)];

a(11) corrected, expressions for a(2)-a(100) added by Max Alekseyev, Nov 02 2013

cp's OEIS Frontend

A230094 Numbers that can be expressed as (m + sum of digits of m) in exactly two ways.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

A320878 Primes such that iteration of A062028 (n + its digit sum) yields 6 primes in a row.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A225793 Numbers n that can be uniquely expressed as (m + sum of digits of m) for some m.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

A336983 Bogota numbers that are not Colombian numbers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A230100 Numbers that can be expressed as (m + sum of digits of m) in exactly three ways.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

A247104 Squarefree self-numbers.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A358351 Number of values of m such that m + (sum of digits of m) + (product of digits of m) is n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

Python

A377422 Numbers that can be expressed as (m + sum of digits of m) in exactly four ways.