A010061 -id:A010061 - cp's OEIS frontend

A230641 a(n) = n + (sum of digits in base-3 representation of n).

0, 2, 4, 4, 6, 8, 8, 10, 12, 10, 12, 14, 14, 16, 18, 18, 20, 22, 20, 22, 24, 24, 26, 28, 28, 30, 32, 28, 30, 32, 32, 34, 36, 36, 38, 40, 38, 40, 42, 42, 44, 46, 46, 48, 50, 48, 50, 52, 52, 54, 56, 56, 58, 60, 56, 58, 60, 60, 62, 64, 64, 66, 68, 66, 68, 70, 70, 72, 74, 74, 76, 78, 76, 78, 80, 80, 82, 84, 84, 86, 88, 82

Offset: 0

N. J. A. Sloane, Oct 31 2013

The image of this sequence is the set of nonnegative even numbers (A005843). Joshi (1973) proved that the sequence of base-q self numbers (analogous to A003052) is the sequence of odd numbers (A005408) for all odd q. - Amiram Eldar, Nov 28 2020

V. S. Joshi, Ph.D. dissertation, Gujarat Univ., Ahmedabad (India), October, 1973.
József Sándor and Borislav Crstici, Handbook of Number theory II, Kluwer Academic Publishers, 2004, Chapter 4, p. 384-386.

Donovan Johnson, Table of n, a(n) for n = 0..10000
Index entries for Colombian or self numbers and related sequences

Related base-3 sequences: A053735, A134451, A230641, A230642, A230643, A230853, A230854, A230855, A230856, A230639, A230640, A010063 (trajectory of 1)

Cf. A228088, A010061, A230091, A230092, A227915.

a230641 n = a053735 n + n  -- Reinhard Zumkeller, May 19 2015

Table[n + Plus @@ IntegerDigits[n, 3], {n, 0, 100}] (* Amiram Eldar, Nov 28 2020 *)

a(n) = n + A053735(n). - Amiram Eldar, Nov 28 2020

A010065 a(n+1) = a(n) + sum of digits in base 4 representation of a(n), with a(0) = 1.

Original entry on oeis.org

1, 2, 4, 5, 7, 11, 16, 17, 19, 23, 28, 32, 34, 38, 43, 50, 55, 62, 70, 74, 79, 86, 91, 98, 103, 110, 118, 125, 133, 137, 142, 149, 154, 161, 166, 173, 181, 188, 196, 200, 205, 212, 217, 224, 229, 236, 244, 251, 262, 266, 271, 278, 283, 290, 295

Offset: 0

Leonid Broukhis

S. R. Finch, Mathematical Constants, Cambridge, 2003, Section 2.24.

Donovan Johnson, Table of n, a(n) for n = 0..10000
Index entries for Colombian or self numbers and related sequences

Cf. A003052, A010061, A010062, A010064, A004207.

Related base-4 sequences: A053737, A230631, A230632, A010064, A230633, A230634, A230635, A230636, A230637, A230638, A010065 (trajectory of 1)

a010065 n = a010065_list !! n
a010065_list = iterate a230631 1  -- Reinhard Zumkeller, Mar 20 2015

a(n+1) = A230631(a(n)). - Reinhard Zumkeller, Mar 20 2015

More terms from Neven Juric, Apr 11 2008

A010067 Base 6 self or Colombian numbers (not of form k + sum of base 6 digits of k).

Original entry on oeis.org

1, 3, 5, 12, 19, 26, 33, 40, 42, 49, 56, 63, 70, 77, 79, 86, 93, 100, 107, 114, 116, 123, 130, 137, 144, 151, 153, 160, 167, 174, 181, 188, 190, 197, 204, 211, 218, 229, 236, 243, 250, 257, 259, 266, 273, 280, 287, 294, 296, 303, 310, 317, 324, 331, 333, 340, 347

Offset: 1

Leonid Broukhis

Steven R. Finch, Mathematical Constants, Cambridge, 2003, Section 2.24, pp. 179-180.
József Sándor and Borislav Crstici, Handbook of Number theory II, Kluwer Academic Publishers, 2004, Chapter 4, p. 384-386.

Cf. A003052, A010061, A010064, A010070, A053827.

s[n_] := n + Plus @@ IntegerDigits[n, 6]; m = 350; Complement[Range[m], Array[s, m]] (* Amiram Eldar, Nov 28 2020 *)

More terms from Amiram Eldar, Nov 28 2020

A010070 Base 8 self or Colombian numbers (not of form k + sum of base 8 digits of k).

Original entry on oeis.org

1, 3, 5, 7, 16, 25, 34, 43, 52, 61, 70, 72, 81, 90, 99, 108, 117, 126, 135, 137, 146, 155, 164, 173, 182, 191, 200, 202, 211, 220, 229, 238, 247, 256, 265, 267, 276, 285, 294, 303, 312, 321, 330, 332, 341, 350, 359, 368, 377, 386, 395, 397, 406, 415, 424, 433

Offset: 1

Leonid Broukhis

Steven R. Finch, Mathematical Constants, Cambridge, 2003, Section 2.24, pp. 179-180.
József Sándor and Borislav Crstici, Handbook of Number theory II, Kluwer Academic Publishers, 2004, Chapter 4, p. 384-386.

Cf. A003052, A010061, A010064, A010067, A053829.

s[n_] := n + Plus @@ IntegerDigits[n, 8]; m = 500; Complement[Range[m], Array[s, m]] (* Amiram Eldar, Nov 28 2020 *)

More terms from Amiram Eldar, Nov 28 2020

A230092 Numbers of the form k + wt(k) for exactly three distinct k, where wt(k) = A000120(k) is the binary weight of k.

Original entry on oeis.org

129, 134, 386, 391, 515, 518, 642, 647, 899, 904, 1028, 1030, 1154, 1159, 1411, 1416, 1540, 1543, 1667, 1672, 1924, 1929, 2178, 2183, 2435, 2440, 2564, 2567, 2691, 2696, 2948, 2953, 3077, 3079, 3203, 3208, 3460, 3465, 3589, 3592, 3716, 3721, 3973, 3978, 4226

Offset: 1

N. J. A. Sloane, Oct 10 2013

The positions of entries equal to 3 in A228085, or numbers that appear exactly thrice in A092391.

Numbers that can be expressed as the sum of distinct terms of the form 2^n+1, n=0,1,... in exactly three ways.

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

Cf. A000120, A010061, A228088, A230058, A230091.

Cf. A227915.

a230092 n = a230092_list !! (n-1)
a230092_list = filter ((== 3) . a228085) [1..]
-- Reinhard Zumkeller, Oct 13 2013

Maple
```
For Maple code see A230091.
```

nt = 1000; (* number of terms to produce *)
S[kmax_] := S[kmax] = Table[k + Total[IntegerDigits[k, 2]], {k, 0, kmax}] // Tally // Select[#, #[[2]] == 3&][[All, 1]]& // PadRight[#, nt]&;
S[nt];
S[kmax = 2 nt];
While[S[kmax] =!= S[kmax/2], kmax *= 2];
S[kmax] (* Jean-François Alcover, Mar 04 2023 *)

A227915 Numbers of the form k + wt(k) for exactly four distinct k, where wt(k) = A000120(k) is the binary weight of k.

Original entry on oeis.org

4102, 12295, 20487, 28680, 36871, 45064, 53256, 61449, 69639, 77832, 86024, 94217, 102408, 110601, 118793, 126986, 135175, 143368, 151560, 159753, 167944, 176137, 184329, 192522, 200712, 208905, 217097, 225290, 233481, 241674, 249866, 258059, 266247, 274440, 282632, 290825, 299016, 307209, 315401, 323594, 331784, 339977

Offset: 1

Reinhard Zumkeller, Oct 13 2013

Numbers occurring exactly four times in A092391: A228085(a(n)) = 4. For the first number that appears k times, see A230303.

			a(1) = 4102, the four k with A092391(k) = 4102 being:
4091 = '111111111011', A000120(4091) = 11, 4091 + 11 = 4102;
4092 = '111111111100', A000120(4092) = 12, 4092 + 10 = 4102;
4099 = '1000000000011', A000120(4099) = 3, 4099 + 3 = 4102;
4100 = '1000000000100', A000120(4100) = 2, 4100 + 2 = 4102.

Donovan Johnson, Table of n, a(n) for n = 1..10000
Index entries for Colombian or self numbers and related sequences

Cf. A092391, A228085, A230092, A230091, A228088, A010061, A230093, A230303.

a227915 n = a227915_list !! (n-1)
a227915_list = filter ((== 4) . a228085) [1..]

A227643 a(0)=1; for n > 0, a(n) = 1 + Sum_{i=A228086(n)..A228087(n)} [A092391(i) = n]*a(i), where [] is the Iverson bracket, resulting in 1 when i + A000120(i) = n and 0 otherwise.

Original entry on oeis.org

1, 1, 2, 3, 1, 5, 1, 6, 2, 3, 7, 4, 8, 1, 13, 1, 2, 16, 1, 18, 2, 1, 21, 1, 2, 22, 3, 2, 23, 4, 1, 26, 1, 6, 2, 7, 29, 1, 37, 1, 2, 38, 3, 2, 39, 4, 1, 42, 1, 5, 3, 1, 48, 4, 1, 50, 1, 5, 2, 2, 51, 6, 3, 1, 54, 55, 7, 59, 8, 2, 68, 1, 3, 69, 4, 2, 70, 5, 1, 73, 1

Offset: 0

Andres M. Torres, Jul 18 2013

Each a(n) = 1 + the count of nodes in the finite subtree defined by the edge relation parent = child + A000120(child). In other words, one more than the count of n's descendants, by which we mean the whole transitive closure of all children emanating from the parent at n. The subtree is finite because successive descendant values get smaller and approach zero.

			0 has no children distinct from itself (we only have A092391(0)=0), so we define a(0) = (0+1) = 1,
1 has no children (it is one of the terms of A010061), so a(1) = (0+1) = 1,
4 and 6 are also members of A010061, so both a(4) and a(6) = (0+1) = 1,
7 has 1,2,3,4 and 5 among its descendants (as A092391(5)=7, A092391(3)=A092391(4)=5, A092391(2)=3, A092391(1)=2), so a(7) = (5+1) = 6,
8 has 6 as a child value,        so a(8) = (1+1) = 2,
9 has 6 and 8 as descendants,    so a(9) = (2+1) = 3,
10 has {1,2,3,4,5,7}             so a(10) = (6+1) = 7.

Andres M. Torres, Table of n, a(n) for n = 0..9999
Andres M. Torres, Blitz3D Basic code for computing this sequence
Index entries for Colombian or self numbers and related sequences

Cf. A010061 (gives the positions of ones), A000120, A092391, A228082, A228083, A228085, A227359, A227361, A227408.

Cf. also A213727 for a descendant counts for a similar tree defined by the edge relation parent = child - A000120(child).

;; A deficient definition which works only up to n=128:
(definec (A227643deficient n) (cond ((zero? n) 1) ((zero? (A228085 n)) 1) ((= 1 (A228085 n)) (+ 1 (A227643deficient (A228086 n)))) ((= 2 (A228085 n)) (+ 1 (A227643deficient (A228086 n)) (A227643deficient (A228087 n)))) (else (error "Not yet implemented for cases where n has more than two immediate children!"))))
;; Another definition that works for all n, but is somewhat slower:
(definec (A227643full n) (cond ((zero? n) 1) (else (+ 1 (add (lambda (i) (if (= (A092391 i) n) (A227643full i) 0)) (A228086 n) (A228087 n))))))
;; Auxiliary function add implements sum_{i=lowlim..uplim} intfun(i)
(define (add intfun lowlim uplim) (let sumloop ((i lowlim) (res 0)) (cond ((> i uplim) res) (else (sumloop (1+ i) (+ res (intfun i)))))))
;; by Antti Karttunen, Aug 16 2013, macro definec can be found in his IntSeq-library.

From Antti Karttunen, Aug 16 2013: (Start)
a(0)=1; and for n > 0, if A228085(n)=0 then a(n)=1; if A228085(n)=1 then a(n)=1+a(A228086(n)); if A228085(n)=2 then a(n)=1+a(A228086(n))+a(A228087(n)); otherwise (when A228085(n)>2) cannot be computed with this formula, which works only up to n=128.
a(0)=1; and for n > 0, a(n) = 1+Sum_{i=A228086(n)..A228087(n)} [A092391(i) = n]*a(i). (Here [...] denotes the Iverson bracket, resulting in 1 when i+A000120(i) = n and 0 otherwise. This formula works with all n.) (End)

A228086 a(n) is the least k which satisfies n = k + bitcount(k), or 0 if no such k exists. Here bitcount(k) (or wt(k), A000120) gives the number of 1's in binary representation of nonnegative integer k.

Original entry on oeis.org

0, 0, 1, 2, 0, 3, 0, 5, 6, 8, 7, 9, 10, 0, 11, 0, 13, 14, 0, 15, 18, 0, 19, 0, 21, 22, 24, 23, 25, 26, 0, 27, 0, 29, 30, 33, 31, 0, 35, 0, 37, 38, 40, 39, 41, 42, 0, 43, 0, 45, 46, 0, 47, 50, 0, 51, 0, 53, 54, 56, 55, 57, 58, 0, 59, 64, 61, 62, 66, 63, 67, 0

Offset: 0

Antti Karttunen, Aug 09 2013

nonn

A083058(n)+1 gives a lower bound for nonzero terms, n-1 an upper bound.

Antti Karttunen, Table of n, a(n) for n = 0..8192
Index entries for Colombian or self numbers and related sequences

Cf. A228087, A228085, A335599. A010061 gives the positions of zeros after a(0). The union of A010061 and A228088 gives the positions where a(n) = A228087(n).

Cf. also A213723, A227643.

a[n_] := Module[{k}, For[k = n - Floor[Log[2, n]] - 1, k < n, k++, If[n == k + DigitCount[k, 2, 1], Return[k]]]; 0];
a /@ Range[0, 1000]; (* Jean-François Alcover, Nov 28 2020 *)

(define (A228086 n) (if (zero? n) n (let loop ((k (+ (A083058 n) 1))) (cond ((> k n) 0) ((= n (A092391 k)) k) (else (loop (+ 1 k)))))))

A230091 Numbers of the form k + wt(k) for exactly two distinct k, where wt(k) = A000120(k) is the binary weight of k.

Original entry on oeis.org

5, 14, 17, 19, 22, 31, 33, 36, 38, 47, 50, 52, 55, 64, 67, 70, 79, 82, 84, 87, 96, 98, 101, 103, 112, 115, 117, 120, 131, 132, 143, 146, 148, 151, 160, 162, 165, 167, 176, 179, 181, 184, 193, 196, 199, 208, 211, 213, 216, 225, 227, 230, 232, 241, 244, 246, 249, 258, 260, 262, 271, 274, 276, 279, 288, 290, 293, 295

Offset: 1

N. J. A. Sloane, Oct 10 2013

The positions of entries equal to 2 in A228085, or numbers that appear exactly twice in A092391.

Numbers that can be expressed as the sum of distinct terms of the form 2^n+1, n=0,1,... in exactly two ways.

			5 = 3 + 2 = 4 + 1, so 5 is in this list.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Index entries for Colombian or self numbers and related sequences

Cf. A000120, A010061, A092391, A228088, A228085, A230058, A230092.

Cf. A227915.

a230091 n = a230091_list !! (n-1)
a230091_list = filter ((== 2) . a228085) [1..]
-- Reinhard Zumkeller, Oct 13 2013

# Maple code for A000120, A092391, A228085, A010061, A228088, A230091, A230092
with(LinearAlgebra):
read transforms;
wt := proc(n) local w, m, i; w := 0; m := n; while m > 0 do i := m mod 2; w := w+i; m := (m-i)/2; od; w; end: # A000120
M:=1000;
lis1:=Array(0..M);
lis2:=Array(0..M);
ctmax:=4;
for i from 0 to ctmax do ct[i]:=Array(0..M); od:
for n from 0 to M do
m:=n+wt(n);
lis1[n]:=m;
if (m <= M) then lis2[m]:=lis2[m]+1; fi;
od:
t1:=[seq(lis1[i],i=0..M)]; # A092391
t2:=[seq(lis2[i],i=0..M)]; # A228085
COMPl(t1); # A010061
for i from 1 to M do h:=lis2[i];
if h <= ctmax then ct[h]:=[op(ct[h]),i]; fi; od:
len:=nops(ct[0]); [seq(ct[0][i],i=1..len)]; # A010061 again
len:=nops(ct[1]); [seq(ct[1][i],i=1..len)]; # A228088
len:=nops(ct[2]); [seq(ct[2][i],i=1..len)]; # A230091
len:=nops(ct[3]); [seq(ct[3][i],i=1..len)]; # A230092

nt = 100; (* number of terms to produce *)
S[kmax_] := S[kmax] = Table[k + Total[IntegerDigits[k, 2]], {k, 0, kmax}] // Tally // Select[#, #[[2]] == 2&][[All, 1]]& // PadRight[#, nt]&;
S[nt];
S[kmax = 2 nt];
While[S[kmax] =!= S[kmax/2], kmax *= 2];
S[kmax] (* Jean-François Alcover, Mar 04 2023 *)

A228087 a(n) = largest k which satisfies n = k + bitcount(k), or 0 if no such k exists. Here bitcount(k) (A000120) gives the number of 1's in binary representation of nonnegative integer k.

Original entry on oeis.org

0, 0, 1, 2, 0, 4, 0, 5, 6, 8, 7, 9, 10, 0, 12, 0, 13, 16, 0, 17, 18, 0, 20, 0, 21, 22, 24, 23, 25, 26, 0, 28, 0, 32, 30, 33, 34, 0, 36, 0, 37, 38, 40, 39, 41, 42, 0, 44, 0, 45, 48, 0, 49, 50, 0, 52, 0, 53, 54, 56, 55, 57, 58, 0, 60, 64, 61, 65, 66, 63, 68, 0

Offset: 0

Antti Karttunen, Aug 09 2013

nonn

A083058(n)+1 gives a lower bound for nonzero terms, n-1 an upper bound.

Antti Karttunen, Table of n, a(n) for n = 0..8192
Index entries for Colombian or self numbers and related sequences

Cf. A228086, A228085. A010061 gives the positions of zeros after a(0). The union of A010061 and A228088 gives the positions where a(n) = A228086(n).

Cf. also A213724, A227643.

(define (A228087 n) (let loop ((k n)) (cond ((<= k (A083058 n)) 0) ((= n (A092391 k)) k) (else (loop (- k 1))))))

cp's OEIS Frontend

A230641 a(n) = n + (sum of digits in base-3 representation of n).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A010065 a(n+1) = a(n) + sum of digits in base 4 representation of a(n), with a(0) = 1.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Haskell

Formula

Extensions

A010067 Base 6 self or Colombian numbers (not of form k + sum of base 6 digits of k).

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

Extensions

A010070 Base 8 self or Colombian numbers (not of form k + sum of base 8 digits of k).

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

Extensions

A230092 Numbers of the form k + wt(k) for exactly three distinct k, where wt(k) = A000120(k) is the binary weight of k.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

A227915 Numbers of the form k + wt(k) for exactly four distinct k, where wt(k) = A000120(k) is the binary weight of k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

A227643 a(0)=1; for n > 0, a(n) = 1 + Sum_{i=A228086(n)..A228087(n)} [A092391(i) = n]*a(i), where [] is the Iverson bracket, resulting in 1 when i + A000120(i) = n and 0 otherwise.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Scheme

Formula

A228086 a(n) is the least k which satisfies n = k + bitcount(k), or 0 if no such k exists. Here bitcount(k) (or wt(k), A000120) gives the number of 1's in binary representation of nonnegative integer k.

Views

Author

Keywords