A026338 -id:A026338 - cp's OEIS frontend

A026339 a(n) = least k such that s(k) = n, where s = A026338.

1, 3, 4, 6, 8, 9, 11, 12, 15, 16, 18, 20, 21, 22, 24, 26, 27, 29, 30, 33, 35, 36, 38, 39, 42, 43, 45, 47, 48, 49, 51, 52, 54, 56, 57, 60, 61, 62, 63, 66, 67, 69, 70, 72, 75, 76, 78, 80, 81, 83, 84, 87, 88, 89, 90, 93, 96, 97, 98, 99, 102, 103

Offset: 1

Clark Kimberling

nonn

A026340 a(n) = greatest k such that s(k) = n, where s = A026338.

Original entry on oeis.org

2, 5, 7, 10, 13, 14, 17, 19, 23, 25, 28, 31, 32, 34, 37, 40, 41, 44, 46, 50, 53, 55, 58, 59, 64, 65, 68, 71, 73, 74, 77, 79, 82, 85, 86, 91, 92, 94, 95, 100, 101, 104, 106, 109, 113, 115, 118, 121, 122, 125, 127, 131, 133, 134, 136, 140

Offset: 1

Clark Kimberling

nonn

A026341 a(n) = sum of the numbers between the two n's in A026338.

Original entry on oeis.org

0, 3, 6, 14, 25, 24, 38, 48, 75, 89, 114, 142, 141, 160, 193, 229, 228, 267, 293, 354, 402, 434, 487, 486, 602, 601, 663, 728, 771, 770, 840, 886, 961, 1039, 1038, 1204, 1203, 1258, 1257, 1439, 1438, 1533, 1595, 1695, 1836, 1904

Offset: 1

Clark Kimberling

nonn

A214371 If a(n) has not yet been defined then set a(n) = least positive integer that has not yet occurred; also if n>1 and a(n+a(n)) has not yet been defined then set a(n+a(n)) = a(n).

Original entry on oeis.org

1, 2, 3, 2, 4, 3, 5, 6, 4, 7, 8, 5, 4, 6, 9, 10, 7, 11, 8, 6, 12, 13, 14, 9, 15, 10, 8, 16, 11, 17, 18, 19, 12, 20, 13, 10, 14, 21, 22, 15, 23, 24, 25, 16, 12, 10, 17, 13, 18, 26, 19, 27, 28, 20, 15, 10, 12, 29, 21, 16, 22, 30, 31, 23, 32, 24, 18, 25, 12, 19, 33

Offset: 1

Alex Ratushnyak, Jul 14 2012

Cf. A214370.

Cf. A026242, A026338.

mex[a_]:=Module[{q}, q=1; While[MemberQ[a,q], q++]; q]; a = Table[0,{k, 1, 100}]; For[n=1, n<=100, n++, {If[a[[n]]==0, a[[n]] = mex[a]]; If[n>1, {nan = n+a[[n]]; If[(nan <= Length[a]) && (a[[nan]] == 0), a[[nan]] = a[[n]]]}]; }]; a

SIZE = 300
a = [-8]*SIZE
top=0
for n in range(SIZE):
    if a[n]==-8:       # if a[n] is undefined yet
        top+=1
        a[n]=top
    if 1

a(1)=1, for n>1, a(n) = A214370(n-1)+1.

cp's OEIS Frontend

A026339 a(n) = least k such that s(k) = n, where s = A026338.

Views

Author

Keywords

A026340 a(n) = greatest k such that s(k) = n, where s = A026338.

Views

Author

Keywords

A026341 a(n) = sum of the numbers between the two n's in A026338.

Views

Author

Keywords

A214371 If a(n) has not yet been defined then set a(n) = least positive integer that has not yet occurred; also if n>1 and a(n+a(n)) has not yet been defined then set a(n+a(n)) = a(n).

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Python

Formula