Sequence Database

A database with 2076264 machine generated integer and decimal sequences.

Displaying result 0-99 of total 23275. [0] [1] [2] [3] [4] ... [232]

Sequence dzai5u2gp2yi

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 13, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 28, 29, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 44, 45, 48, 49, 50, more...

integer, strictly-monotonic, +

a(n)=comp[or(10, n)]
or(a,b)=bitwise or
comp(a)=complement function of a (in range)
n≥0
4 operations
Bitwise

Sequence 2qapv330z3kcm

0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 17, 18, 19, 20, 21, 22, 23, 24, 26, 28, 30, 32, 33, 34, 35, 36, 37, 38, 39, 40, 42, 44, 46, 48, 49, 50, more...

integer, strictly-monotonic, +

a(n)=comp[or(9, n)]
or(a,b)=bitwise or
comp(a)=complement function of a (in range)
n≥0
4 operations
Bitwise

Sequence 25p51iucreprh

0, 1, 2, 3, 4, 5, 6, 7, 12, 13, 15, more...

integer, strictly-monotonic, +, A028819

a(n)=comp[xor(58, n)]
xor(a,b)=bitwise exclusive or
comp(a)=complement function of a (in range)
n≥2
4 operations
Bitwise

Sequence 1efbwh1ctyy1m

0, 1, 2, 3, 4, 5, 6, 7, 16, 17, 18, 19, 20, 21, 22, 23, 32, 33, 34, 35, 36, 37, 38, 39, 48, 49, 50, more...

integer, strictly-monotonic, +

a(n)=comp[or(8, n)]
or(a,b)=bitwise or
comp(a)=complement function of a (in range)
n≥0
4 operations
Bitwise

Sequence mnh5nanr224tb

0, 1, 2, 3, 5, 8, 9, 10, 11, 12, 13, 14, 15, more...

integer, strictly-monotonic, +, A169655

a(n)=comp[xor(54, n)]
xor(a,b)=bitwise exclusive or
comp(a)=complement function of a (in range)
n≥0
4 operations
Bitwise

Sequence 5vfgiwmzk5d5g

2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, more...

integer, strictly-monotonic, +, A046039

a(n)=comp[and(17, n)]
and(a,b)=bitwise and
comp(a)=complement function of a (in range)
n≥0
4 operations
Bitwise
a(n)=comp[xor((4^a(n-2))², a(n-1))]
a(0)=0
a(1)=1
xor(a,b)=bitwise exclusive or
comp(a)=complement function of a (in range)
n≥0
7 operations
Recursive
a(n)=comp[(a(n-2)-2)^n+a(n-1)]
a(0)=0
a(1)=1
comp(a)=complement function of a (in range)
n≥2
8 operations
Recursive

Sequence adzllbfwoymrm

16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 48, 49, 50, more...

integer, strictly-monotonic, +, A115420

a(n)=comp[and(47, n)]
and(a,b)=bitwise and
comp(a)=complement function of a (in range)
n≥0
4 operations
Bitwise

Sequence zomgbqlhrcvzn

16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 31, more...

integer, strictly-monotonic, +, A296754

a(n)=comp[xor(44, n)]
xor(a,b)=bitwise exclusive or
comp(a)=complement function of a (in range)
n≥0
4 operations
Bitwise

Sequence nv3d1oxddgycl

-46, -47, -48, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[n-5]
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence 5xt5wmxdrfyk

-45, -46, -47, -48, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[n-6]
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence bhpdfolrjjxbj

-44, -45, -46, -47, -48, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[n-7]
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence fzblyofpfyiap

-43, -44, -45, -46, -47, -48, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[n-8]
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence bvpgazflhpqjf

-42, -43, -44, -45, -46, -47, -48, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[n-9]
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence suexm0k5amgh

-41, -42, -43, -44, -45, -46, -47, -48, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[n-10]
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence 4u1kfdfsg0vym

-1, -2, -3, -5, -6, -7, -9, -10, -11, -13, -14, -15, -17, -18, -19, -21, -22, -23, -25, -26, -27, -29, -30, -31, -33, -34, -35, -37, -38, -39, -41, -42, -43, -45, -46, -47, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[4*n]
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic
a(n)=-comp[lcm(n, 4)]
lcm(a,b)=least common multiple
comp(a)=complement function of a (in range)
n≥0
5 operations
Divisibility
a(n)=-comp[4+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
5 operations
Recursive

Sequence 05w5bwjh5l31f

-1, -2, -3, -4, -6, -7, -8, -9, -11, -12, -13, -14, -16, -17, -18, -19, -21, -22, -23, -24, -26, -27, -28, -29, -31, -32, -33, -34, -36, -37, -38, -39, -41, -42, -43, -44, -46, -47, -48, -49, more...

integer, strictly-monotonic, -

a(n)=-comp[5*n]
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic
a(n)=-comp[lcm(n, 5)]
lcm(a,b)=least common multiple
comp(a)=complement function of a (in range)
n≥0
5 operations
Divisibility
a(n)=-comp[5+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
5 operations
Recursive

Sequence 2trvwg13yb54p

-1, -2, -3, -4, -5, -7, -8, -9, -10, -11, -13, -14, -15, -16, -17, -19, -20, -21, -22, -23, -25, -26, -27, -28, -29, -31, -32, -33, -34, -35, -37, -38, -39, -40, -41, -43, -44, -45, -46, -47, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[6*n]
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic
a(n)=-comp[lcm(n, 6)]
lcm(a,b)=least common multiple
comp(a)=complement function of a (in range)
n≥0
5 operations
Divisibility
a(n)=-comp[6+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
5 operations
Recursive

Sequence eaaajtj103wqc

-1, -2, -3, -4, -5, -6, -8, -9, -10, -11, -12, -13, -15, -16, -17, -18, -19, -20, -22, -23, -24, -25, -26, -27, -29, -30, -31, -32, -33, -34, -36, -37, -38, -39, -40, -41, -43, -44, -45, -46, -47, -48, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[7*n]
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic
a(n)=-comp[lcm(n, 7)]
lcm(a,b)=least common multiple
comp(a)=complement function of a (in range)
n≥0
5 operations
Divisibility
a(n)=-comp[7+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
5 operations
Recursive

Sequence eepbyllltotxl

-1, -2, -3, -4, -5, -6, -7, -9, -10, -11, -12, -13, -14, -15, -17, -18, -19, -20, -21, -22, -23, -25, -26, -27, -28, -29, -30, -31, -33, -34, -35, -36, -37, -38, -39, -41, -42, -43, -44, -45, -46, -47, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[8*n]
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic
a(n)=-comp[lcm(n, 8)]
lcm(a,b)=least common multiple
comp(a)=complement function of a (in range)
n≥0
5 operations
Divisibility
a(n)=-comp[8+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
5 operations
Recursive

Sequence g2zxl01y3awil

-1, -2, -3, -4, -5, -6, -7, -8, -10, -11, -12, -13, -14, -15, -16, -17, -19, -20, -21, -22, -23, -24, -25, -26, -28, -29, -30, -31, -32, -33, -34, -35, -37, -38, -39, -40, -41, -42, -43, -44, -46, -47, -48, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[9*n]
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic
a(n)=-comp[lcm(n, 9)]
lcm(a,b)=least common multiple
comp(a)=complement function of a (in range)
n≥0
5 operations
Divisibility
a(n)=-comp[9+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
5 operations
Recursive

Sequence zod2nniuaxjeb

-1, -2, -3, -4, -5, -6, -7, -8, -9, -11, -12, -13, -14, -15, -16, -17, -18, -19, -21, -22, -23, -24, -25, -26, -27, -28, -29, -31, -32, -33, -34, -35, -36, -37, -38, -39, -41, -42, -43, -44, -45, -46, -47, -48, -49, more...

integer, strictly-monotonic, -

a(n)=-comp[10*n]
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic
a(n)=-comp[lcm(n, 10)]
lcm(a,b)=least common multiple
comp(a)=complement function of a (in range)
n≥0
5 operations
Divisibility
a(n)=-comp[10+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
5 operations
Recursive

Sequence yfpofoxopawqo

0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 34, 35, 36, 37, 38, 39, 40, 41, 42, 44, 45, 46, 47, 48, 49, 50, more...

integer, strictly-monotonic, +, A235498

a(n)=comp[10+a(n-1)]
a(0)=3
comp(a)=complement function of a (in range)
n≥0
4 operations
Recursive
a(n)=comp[3+10*n]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic
a(n)=comp[3+lcm(n, 10)]
lcm(a,b)=least common multiple
comp(a)=complement function of a (in range)
n≥0
6 operations
Divisibility

Sequence nt0fxus52uzfi

1, 0.3333333333333333, 0.2, 0.14285714285714285, 0.1111111111111111, 0.09090909090909091, 0.07692307692307693, 0.06666666666666667, 0.058823529411764705, 0.05263157894736842, 0.047619047619047616, 0.043478260869565216, 0.04, 0.037037037037037035, 0.034482758620689655, 0.03225806451612903, 0.030303030303030304, 0.02857142857142857, 0.02702702702702703, 0.02564102564102564, 0.024390243902439025, 0.023255813953488372, 0.022222222222222223, 0.02127659574468085, 0.02040816326530612, more...

decimal, strictly-monotonic, convergent, +

a(n)=1/Δ[n²]
Δ(a)=differences of a
n≥0
5 operations
Power
a(n)=1/comp[2*n]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic
a(n)=1/comp[2+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
6 operations
Recursive
a(n)=1/xor(1, 2*n)
xor(a,b)=bitwise exclusive or
n≥0
7 operations
Bitwise
a(n)=n/C(2*n, 2)
C(n,k)=binomial coefficient
n≥1
7 operations
Combinatoric

Sequence 5xsou4tj43bbg

1, 2, 3, 5, 6, 7, 9, 10, 11, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, more...

integer, strictly-monotonic, +, A194375

a(n)=comp[Ω(n^4)]
Ω(n)=number of prime divisors of n
comp(a)=complement function of a (in range)
n≥1
5 operations
Prime
a(n)=comp[4*(4-n)]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic
a(n)=comp[4*n%5]
comp(a)=complement function of a (in range)
n≥0
6 operations
Divisibility
a(n)=comp[4*ceil(log(n))]
comp(a)=complement function of a (in range)
n≥1
6 operations
Power
a(n)=comp[and(n, 4+a(n-1))]
a(0)=0
and(a,b)=bitwise and
comp(a)=complement function of a (in range)
n≥0
6 operations
Recursive

Sequence r3c0p44riudip

2, 0.6666666666666666, 0.4, 0.2857142857142857, 0.2222222222222222, 0.18181818181818182, 0.15384615384615385, 0.13333333333333333, 0.11764705882352941, 0.10526315789473684, 0.09523809523809523, 0.08695652173913043, 0.08, 0.07407407407407407, 0.06896551724137931, 0.06451612903225806, 0.06060606060606061, 0.05714285714285714, 0.05405405405405406, 0.05128205128205128, 0.04878048780487805, 0.046511627906976744, 0.044444444444444446, 0.0425531914893617, 0.04081632653061224, more...

decimal, strictly-monotonic, convergent, +

a(n)=2/Δ[n²]
Δ(a)=differences of a
n≥0
5 operations
Power
a(n)=2/comp[2*n]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic
a(n)=2/comp[2+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
6 operations
Recursive
a(n)=2/xor(1, 2*n)
xor(a,b)=bitwise exclusive or
n≥0
7 operations
Bitwise

Sequence s3nsa2xi4in0m

3, 1, 0.6, 0.42857142857142855, 0.3333333333333333, 0.2727272727272727, 0.23076923076923078, 0.2, 0.17647058823529413, 0.15789473684210525, 0.14285714285714285, 0.13043478260869565, 0.12, 0.1111111111111111, 0.10344827586206896, 0.0967741935483871, 0.09090909090909091, 0.08571428571428572, 0.08108108108108109, 0.07692307692307693, 0.07317073170731707, 0.06976744186046512, 0.06666666666666667, 0.06382978723404255, 0.061224489795918366, more...

decimal, strictly-monotonic, convergent, +

a(n)=3/Δ[n²]
Δ(a)=differences of a
n≥0
5 operations
Power
a(n)=3/comp[2*n]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic
a(n)=3/comp[2+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
6 operations
Recursive
a(n)=3/xor(1, 2*n)
xor(a,b)=bitwise exclusive or
n≥0
7 operations
Bitwise

Sequence 00x33uwrcsbt

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 20, 21, 22, 23, 24, 25, 26, 28, 29, 30, 31, 32, 33, 34, 36, 37, 38, 39, 40, 41, 42, 44, 45, 46, 47, 48, 49, 50, more...

integer, strictly-monotonic, +, A004775

a(n)=comp[3+8*n]
comp(a)=complement function of a (in range)
n≥1
6 operations
Arithmetic
a(n)=comp[xor(3, 8*n)]
xor(a,b)=bitwise exclusive or
comp(a)=complement function of a (in range)
n≥1
6 operations
Bitwise
a(n)=comp[3+lcm(n, 8)]
lcm(a,b)=least common multiple
comp(a)=complement function of a (in range)
n≥1
6 operations
Divisibility
a(n)=comp[4+or(7, n²)]
or(a,b)=bitwise or
comp(a)=complement function of a (in range)
n≥0
7 operations
Power
a(n)=comp[4+or(6, p(n))]
p(n)=nth prime
or(a,b)=bitwise or
comp(a)=complement function of a (in range)
n≥2
7 operations
Prime

Sequence jcjtuhj2bwiuo

0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 13, 14, 16, 17, 19, 20, 22, 23, 25, 26, 28, 29, 31, 32, 34, 35, 37, 38, 40, 41, 43, 44, 46, 47, 49, 50, more...

integer, strictly-monotonic, +

a(n)=comp[3*(3+n)]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic

Sequence s435k5t1ha1pp

0, 1, 2, 3, 4, 5, 7, 8, 10, 11, 13, 14, 16, 17, 19, 20, 22, 23, 25, 26, 28, 29, 31, 32, 34, 35, 37, 38, 40, 41, 43, 44, 46, 47, 49, 50, more...

integer, strictly-monotonic, +

a(n)=comp[3*(2+n)]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic

Sequence zya3g2ztesgxh

0, 3, 6, 9, 12, 18, 21, 24, 27, 33, 36, 39, 42, 48, 51, 54, 57, 63, 66, 69, 72, 78, 81, 84, 87, 93, 96, 99, 102, 108, 111, 114, 117, 123, 126, 129, 132, 138, 141, 144, 147, more...

integer, strictly-monotonic, +, A271449 (weak, multiple)

a(n)=3*comp[5*n]
comp(a)=complement function of a (in range)
n≥1
6 operations
Arithmetic
a(n)=3*comp[lcm(n, 5)]
lcm(a,b)=least common multiple
comp(a)=complement function of a (in range)
n≥1
6 operations
Divisibility

Sequence yz4jqdqofalgn

0.3333333333333333, 0.6666666666666666, 1.3333333333333333, 1.6666666666666667, 2.3333333333333335, 2.6666666666666665, 3.3333333333333335, 3.6666666666666665, 4.333333333333333, 4.666666666666667, 5.333333333333333, 5.666666666666667, 6.333333333333333, 6.666666666666667, 7.333333333333333, 7.666666666666667, 8.333333333333334, 8.666666666666666, 9.333333333333334, 9.666666666666666, 10.333333333333334, 10.666666666666666, 11.333333333333334, 11.666666666666666, 12.333333333333334, more...

decimal, strictly-monotonic, +

a(n)=comp[3*n]/3
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic
a(n)=comp[3+a(n-1)]/3
a(0)=0
comp(a)=complement function of a (in range)
n≥0
6 operations
Recursive

Sequence vg35pptckgoqf

0.5, 1, 2, 2.5, 3.5, 4, 5, 5.5, 6.5, 7, 8, 8.5, 9.5, 10, 11, 11.5, 12.5, 13, 14, 14.5, 15.5, 16, 17, 17.5, 18.5, more...

decimal, strictly-monotonic, +

a(n)=comp[3*n]/2
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic
a(n)=comp[3+a(n-1)]/2
a(0)=0
comp(a)=complement function of a (in range)
n≥0
6 operations
Recursive

Sequence ompau4d3lzgjk

1, 0.5, 0.25, 0.2, 0.14285714285714285, 0.125, 0.1, 0.09090909090909091, 0.07692307692307693, 0.07142857142857142, 0.0625, 0.058823529411764705, 0.05263157894736842, 0.05, 0.045454545454545456, 0.043478260869565216, 0.04, 0.038461538461538464, 0.03571428571428571, 0.034482758620689655, 0.03225806451612903, 0.03125, 0.029411764705882353, 0.02857142857142857, 0.02702702702702703, more...

decimal, strictly-monotonic, +

a(n)=1/comp[3*n]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic
a(n)=1/comp[3+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
6 operations
Recursive

Sequence 3m2pj45dsmjnm

1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, more...

integer, strictly-monotonic, +, A194386

a(n)=comp[6*(6-n)]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic
a(n)=comp[6*n%7]
comp(a)=complement function of a (in range)
n≥0
6 operations
Divisibility
a(n)=comp[6*ceil(log2(n))]
comp(a)=complement function of a (in range)
n≥1
6 operations
Power
a(n)=comp[Δ[lcm(stern(n), 6)]]
stern(n)=Stern-Brocot sequence
lcm(a,b)=least common multiple
Δ(a)=differences of a
comp(a)=complement function of a (in range)
n≥0
6 operations
Recursive
a(n)=comp[6*Ω(∑[n])]
∑(a)=partial sums of a
Ω(n)=number of prime divisors of n
comp(a)=complement function of a (in range)
n≥1
6 operations
Prime

Sequence 0rhuod5yewazh

2, 1, 0.5, 0.4, 0.2857142857142857, 0.25, 0.2, 0.18181818181818182, 0.15384615384615385, 0.14285714285714285, 0.125, 0.11764705882352941, 0.10526315789473684, 0.1, 0.09090909090909091, 0.08695652173913043, 0.08, 0.07692307692307693, 0.07142857142857142, 0.06896551724137931, 0.06451612903225806, 0.0625, 0.058823529411764705, 0.05714285714285714, 0.05405405405405406, more...

decimal, strictly-monotonic, +

a(n)=2/comp[3*n]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic
a(n)=2/comp[3+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
6 operations
Recursive

Sequence ooy1az43go2mn

3, 1.5, 0.75, 0.6, 0.42857142857142855, 0.375, 0.3, 0.2727272727272727, 0.23076923076923078, 0.21428571428571427, 0.1875, 0.17647058823529413, 0.15789473684210525, 0.15, 0.13636363636363635, 0.13043478260869565, 0.12, 0.11538461538461539, 0.10714285714285714, 0.10344827586206896, 0.0967741935483871, 0.09375, 0.08823529411764706, 0.08571428571428572, 0.08108108108108109, more...

decimal, strictly-monotonic, +

a(n)=3/comp[3*n]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic
a(n)=3/comp[3+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
6 operations
Recursive

Sequence ddgozo34tdnsj

3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 19, 20, 21, 22, 24, 25, 26, 27, 29, 30, 31, 32, 34, 35, 36, 37, 39, 40, 41, 42, 44, 45, 46, 47, 49, 50, 51, 52, more...

integer, strictly-monotonic, +, A298005

a(n)=3+comp[5*n]
comp(a)=complement function of a (in range)
n≥2
6 operations
Arithmetic

Sequence ymiddqrqkoaum

9, 10, 11, 12, 13, 14, 16, 17, 19, 20, 22, 23, 25, 26, 28, 29, 31, 32, 34, 35, 37, 38, 40, 41, 43, 44, 46, 47, 49, 50, 52, 53, 55, 56, 58, 59, more...

integer, strictly-monotonic, +, A121816

a(n)=9+comp[3*n]
comp(a)=complement function of a (in range)
n≥2
6 operations
Arithmetic

Sequence tlbteu00kahop

12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, -1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, -12, -14, -15, -16, -17, -18, -19, -20, -21, -22, -23, -24, -25, -27, -28, -29, -30, -31, -32, -33, -34, -35, -36, -37, more...

integer, strictly-monotonic, +-, A109065 (multiple)

a(n)=13-comp[13*n]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic

Sequence do0n1pie10j1f

48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, more...

integer, strictly-monotonic, +, A121377 (multiple)

a(n)=47+comp[13*n]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic

Sequence fr2vrw3ou3svb

0, 2, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, more...

integer, strictly-monotonic, +

a(n)=comp[3^n]
comp(a)=complement function of a (in range)
n≥0
4 operations
Power
a(n)=comp[3*a(n-1)]
a(0)=1
comp(a)=complement function of a (in range)
n≥0
4 operations
Recursive
a(n)=comp[3^stern(n)]
stern(n)=Stern-Brocot sequence
comp(a)=complement function of a (in range)
n≥0
5 operations
Recursive
a(n)=comp[∏[xor(2, a(n-1))]]
a(0)=1
xor(a,b)=bitwise exclusive or
∏(a)=partial products of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Recursive
a(n)=comp[3^Ω(n)]
Ω(n)=number of prime divisors of n
comp(a)=complement function of a (in range)
n≥1
5 operations
Prime

Sequence ukwrgx0rc1rmp

0, 3, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, more...

integer, strictly-monotonic, +, A057716

a(n)=comp[2^n]
comp(a)=complement function of a (in range)
n≥0
4 operations
Power
a(n)=comp[2*a(n-1)]
a(0)=1
comp(a)=complement function of a (in range)
n≥0
4 operations
Recursive
a(n)=comp[∏[ω(n)]]
ω(n)=number of distinct prime divisors of n
∏(a)=partial products of a
comp(a)=complement function of a (in range)
n≥2
4 operations
Prime
a(n)=comp[and(n, -n)]
and(a,b)=bitwise and
comp(a)=complement function of a (in range)
n≥1
5 operations
Bitwise
a(n)=comp[2^stern(n)]
stern(n)=Stern-Brocot sequence
comp(a)=complement function of a (in range)
n≥0
5 operations
Recursive

Sequence ringqb0zuowcm

0, -1, -2, -4, -5, -6, -8, -9, -10, -12, -13, -14, -16, -17, -18, -20, -21, -22, -24, -25, -26, -28, -29, -30, -32, -33, -34, -36, -37, -38, -40, -41, -42, -44, -45, -46, -48, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[or(3, n)]
or(a,b)=bitwise or
comp(a)=complement function of a (in range)
n≥0
5 operations
Bitwise
a(n)=-comp[4+a(n-1)]
a(0)=3
comp(a)=complement function of a (in range)
n≥0
5 operations
Recursive

Sequence 5h0kuhbszlbai

0, -1, -2, -3, -4, -6, -8, -9, -10, -11, -12, -14, -16, -17, -18, -19, -20, -22, -24, -25, -26, -27, -28, -30, -32, -33, -34, -35, -36, -38, -40, -41, -42, -43, -44, -46, -48, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[or(5, n)]
or(a,b)=bitwise or
comp(a)=complement function of a (in range)
n≥0
5 operations
Bitwise

Sequence pcva2bygmzpwb

0, -1, -2, -3, -4, -5, -8, -9, -10, -11, -12, -13, -16, -17, -18, -19, -20, -21, -24, -25, -26, -27, -28, -29, -32, -33, -34, -35, -36, -37, -40, -41, -42, -43, -44, -45, -48, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[or(6, n)]
or(a,b)=bitwise or
comp(a)=complement function of a (in range)
n≥0
5 operations
Bitwise

Sequence pjpmccteygi4f

0, -1, -2, -3, -4, -5, -6, -8, -9, -10, -11, -12, -13, -14, -16, -17, -18, -19, -20, -21, -22, -24, -25, -26, -27, -28, -29, -30, -32, -33, -34, -35, -36, -37, -38, -40, -41, -42, -43, -44, -45, -46, -48, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[or(7, n)]
or(a,b)=bitwise or
comp(a)=complement function of a (in range)
n≥0
5 operations
Bitwise

Sequence v2qjpkya3sieb

0, -1, -2, -3, -4, -5, -6, -7, -16, -17, -18, -19, -20, -21, -22, -23, -32, -33, -34, -35, -36, -37, -38, -39, -48, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[or(8, n)]
or(a,b)=bitwise or
comp(a)=complement function of a (in range)
n≥0
5 operations
Bitwise

Sequence hocryjotqukin

0, -1, -2, -3, -4, -5, -6, -7, -8, -10, -12, -14, -16, -17, -18, -19, -20, -21, -22, -23, -24, -26, -28, -30, -32, -33, -34, -35, -36, -37, -38, -39, -40, -42, -44, -46, -48, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[or(9, n)]
or(a,b)=bitwise or
comp(a)=complement function of a (in range)
n≥0
5 operations
Bitwise

Sequence kpsdh2wdcfkvb

0, -1, -2, -3, -4, -5, -6, -7, -8, -9, -12, -13, -16, -17, -18, -19, -20, -21, -22, -23, -24, -25, -28, -29, -32, -33, -34, -35, -36, -37, -38, -39, -40, -41, -44, -45, -48, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[or(10, n)]
or(a,b)=bitwise or
comp(a)=complement function of a (in range)
n≥0
5 operations
Bitwise

Sequence xeejutqapzkel

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 15, 18, 19, 22, 23, 26, 27, 30, 31, 34, 35, 38, 39, 42, 43, 46, 47, 50, more...

integer, strictly-monotonic, +, A230776 (multiple)

a(n)=comp[and(61, -n)]
and(a,b)=bitwise and
comp(a)=complement function of a (in range)
n≥0
5 operations
Bitwise

Sequence kuk4rswbav3zl

1, 3, 5, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 23, 24, 25, 26, 27, 28, 29, 30, 31, 33, 35, 37, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, more...

integer, strictly-monotonic, +

a(n)=comp[and(n, -10)]
and(a,b)=bitwise and
comp(a)=complement function of a (in range)
n≥0
5 operations
Bitwise

Sequence z544hbfxogbni

0, 0.3333333333333333, 0.4, 0.42857142857142855, 0.4444444444444444, 0.45454545454545453, 0.46153846153846156, 0.4666666666666667, 0.47058823529411764, 0.47368421052631576, 0.47619047619047616, 0.4782608695652174, 0.48, 0.48148148148148145, 0.4827586206896552, 0.4838709677419355, 0.48484848484848486, 0.4857142857142857, 0.4864864864864865, 0.48717948717948717, 0.4878048780487805, 0.4883720930232558, 0.4888888888888889, 0.48936170212765956, 0.4897959183673469, more...

decimal, strictly-monotonic, +

a(n)=n/Δ[n²]
Δ(a)=differences of a
n≥0
5 operations
Power
a(n)=n/comp[2*n]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic
a(n)=n/comp[2+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
6 operations
Recursive
a(n)=n/xor(1, 2*n)
xor(a,b)=bitwise exclusive or
n≥0
7 operations
Bitwise

Sequence iw1y1dyz4rqmi

1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 14, 16, 17, 18, 19, 21, 22, 23, 24, 26, 27, 28, 29, 31, 32, 33, 34, 36, 37, 38, 39, 41, 42, 43, 44, 46, 47, 48, 49, 50, more...

integer, strictly-monotonic, +, A039116

a(n)=comp[5*de[γ]]
γ EulerGamma=0.5772... (Euler Gamma)
de(a)=decimal expansion of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic
a(n)=comp[5*xor(10, n)]
xor(a,b)=bitwise exclusive or
comp(a)=complement function of a (in range)
n≥1
6 operations
Bitwise
a(n)=comp[lcm(1-n, 5)]
lcm(a,b)=least common multiple
comp(a)=complement function of a (in range)
n≥0
6 operations
Divisibility
a(n)=comp[5*de[sqrt(2)]]
de(a)=decimal expansion of a
comp(a)=complement function of a (in range)
n≥0
6 operations
Power
a(n)=comp[5*de[zetazero(0)]]
zetazero(n)=non trivial zeros of Riemann zeta
de(a)=decimal expansion of a
comp(a)=complement function of a (in range)
n≥0
6 operations
Prime

Sequence wvya5ljldesvn

1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, more...

integer, strictly-monotonic, +

a(n)=comp[3*n²]
comp(a)=complement function of a (in range)
n≥0
5 operations
Power
a(n)=comp[n*3*n]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic

Sequence bfhe34shks25f

0, 0.5, 0.5, 0.6, 0.5714285714285714, 0.625, 0.6, 0.6363636363636364, 0.6153846153846154, 0.6428571428571429, 0.625, 0.6470588235294118, 0.631578947368421, 0.65, 0.6363636363636364, 0.6521739130434783, 0.64, 0.6538461538461539, 0.6428571428571429, 0.6551724137931034, 0.6451612903225806, 0.65625, 0.6470588235294118, 0.6571428571428571, 0.6486486486486487, more...

decimal, non-monotonic, +

a(n)=n/comp[3*n]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic
a(n)=n/comp[3+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
6 operations
Recursive

Sequence ibxa0m1y2gmii

0, 0.5, 0.6666666666666666, 1, 1, 1.1666666666666667, 1.1428571428571428, 1.25, 1.2222222222222223, 1.3, 1.2727272727272727, 1.3333333333333333, 1.3076923076923077, 1.3571428571428572, 1.3333333333333333, 1.375, 1.3529411764705883, 1.3888888888888888, 1.368421052631579, 1.4, 1.380952380952381, 1.4090909090909092, 1.391304347826087, 1.4166666666666667, 1.4, more...

decimal, non-monotonic, +

a(n)=comp[3*n]/n
comp(a)=complement function of a (in range)
n≥1
6 operations
Arithmetic

Sequence 4l1mhw3oh14wk

0, 0.5, 1, 1.25, 1.4, 1.5, 1.5714285714285714, 1.625, 1.6666666666666667, 1.7, 1.7272727272727273, 1.75, 1.7692307692307692, 1.7857142857142858, 1.8, 1.8125, 1.8235294117647058, 1.8333333333333333, 1.8421052631578947, 1.85, 1.8571428571428572, 1.8636363636363635, 1.8695652173913044, 1.875, 1.88, more...

decimal, strictly-monotonic, +

a(n)=comp[2*n]/n
comp(a)=complement function of a (in range)
n≥1
6 operations
Arithmetic
a(n)=comp[2+a(n-1)]/n
a(0)=2
comp(a)=complement function of a (in range)
n≥1
6 operations
Recursive

Sequence 3uloy3kkimg1n

0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, more...

integer, non-monotonic, +, A113217

a(n)=and(1, comp[10*n])
comp(a)=complement function of a (in range)
and(a,b)=bitwise and
n≥1
6 operations
Bitwise
a(n)=comp[10*n]%2
comp(a)=complement function of a (in range)
n≥1
6 operations
Divisibility

Sequence 4dvzw2c55eecp

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 16, 17, more...

integer, strictly-monotonic, +, A004838

a(n)=comp[10+xor(6, n)]
xor(a,b)=bitwise exclusive or
comp(a)=complement function of a (in range)
n≥2
6 operations
Bitwise

Sequence zz2dywv352xon

0, 1, 2, 3, 4, 5, 6, 7, 8, 13, more...

integer, strictly-monotonic, +, A133245

a(n)=comp[9+xor(4, n)]
xor(a,b)=bitwise exclusive or
comp(a)=complement function of a (in range)
n≥1
6 operations
Bitwise
a(n)=a(n-1)+catalan(agc(catalan(a(n-1))))
a(0)=0
catalan(n)=the catalan numbers
agc(n)=number of factorizations into prime powers (abelian group count)
n≥0
6 operations
Prime
a(n)=5^C(a(n-1), 8)+a(n-1)
a(0)=0
C(n,k)=binomial coefficient
n≥0
7 operations
Combinatoric
a(n)=or(n, and(4, p(catalan(a(n-1)))))
a(0)=0
catalan(n)=the catalan numbers
p(n)=nth prime
and(a,b)=bitwise and
or(a,b)=bitwise or
n≥0
7 operations
Prime
a(n)=n+ω(C(a(n-1), 7)!)
a(0)=0
C(n,k)=binomial coefficient
ω(n)=number of distinct prime divisors of n
n≥0
7 operations
Prime

Sequence lwxo35kya3eqj

0, 1, 2, 3, 4, 5, 6, 7, 8, 14, more...

integer, strictly-monotonic, +, A023763 (multiple)

a(n)=comp[9+xor(5, n)]
xor(a,b)=bitwise exclusive or
comp(a)=complement function of a (in range)
n≥1
6 operations
Bitwise
a(n)=a(n-1)+agc(catalan(a(n-1)))!
a(0)=0
catalan(n)=the catalan numbers
agc(n)=number of factorizations into prime powers (abelian group count)
n≥0
6 operations
Prime
a(n)=∑[pt(xor(6, n)^a(n-1))]
a(0)=0
xor(a,b)=bitwise exclusive or
pt(n)=Pascals triangle by rows
∑(a)=partial sums of a
n≥1
7 operations
Combinatoric
a(n)=6^C(a(n-1), 8)+a(n-1)
a(0)=0
C(n,k)=binomial coefficient
n≥0
7 operations
Combinatoric

Sequence nzzaucln1x0he

0, 1, 2, 3, 4, 5, 6, 7, 8, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, more...

integer, strictly-monotonic, +, A146029 (multiple)

a(n)=comp[9+and(7, n)]
and(a,b)=bitwise and
comp(a)=complement function of a (in range)
n≥0
6 operations
Bitwise
a(n)=comp[9+n%8]
comp(a)=complement function of a (in range)
n≥0
6 operations
Divisibility
a(n)=comp[ceil(8+sqrt(n))]
comp(a)=complement function of a (in range)
n≥1
6 operations
Power
a(n)=comp[10-∑[λ(n)]]
λ(n)=Liouville's function
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥1
6 operations
Prime
a(n)=comp[9+Ω(P(n))]
P(n)=partition numbers
Ω(n)=number of prime divisors of n
comp(a)=complement function of a (in range)
n≥0
6 operations
Prime

Sequence 04vosfh5rkvph

0, 1, 2, 3, 4, 5, 6, 7, 13, more...

integer, strictly-monotonic, +, A319723 (weak)

a(n)=comp[xor(5, 7+n)]
xor(a,b)=bitwise exclusive or
comp(a)=complement function of a (in range)
n≥2
6 operations
Bitwise
a(n)=∑[pt(xor(6, n)^a(n-1))]
a(0)=0
xor(a,b)=bitwise exclusive or
pt(n)=Pascals triangle by rows
∑(a)=partial sums of a
n≥2
7 operations
Combinatoric
a(n)=6^C(a(n-1), 7)+a(n-1)
a(0)=0
C(n,k)=binomial coefficient
n≥0
7 operations
Combinatoric

Sequence yf4luvxyhrmvb

0, 1, 2, 3, 4, 5, 6, 7, 14, 15, more...

integer, strictly-monotonic, +, A023789

a(n)=comp[xor(6, 8+n)]
xor(a,b)=bitwise exclusive or
comp(a)=complement function of a (in range)
n≥2
6 operations
Bitwise
a(n)=gcd(τ(3^a(n-2)), 7)+a(n-1)
a(0)=0
a(1)=1
τ(n)=number of divisors of n
gcd(a,b)=greatest common divisor
n≥0
8 operations
Prime

Sequence tpd4ccgp2axkl

0, 1, 2, 3, 4, 5, 6, 7, 17, more...

integer, strictly-monotonic, +, A171678 (weak)

a(n)=comp[8+xor(9, n)]
xor(a,b)=bitwise exclusive or
comp(a)=complement function of a (in range)
n≥1
6 operations
Bitwise
a(n)=10^C(a(n-1), 7)+a(n-1)
a(0)=0
C(n,k)=binomial coefficient
n≥0
7 operations
Combinatoric
a(n)=∑[pt(C(n*a(n-1), 5))]
a(0)=0
C(n,k)=binomial coefficient
pt(n)=Pascals triangle by rows
∑(a)=partial sums of a
n≥0
7 operations
Combinatoric

Sequence osfuelsedmllc

0, 1, 2, 3, 4, 5, 7, 0, 1, 2, 3, 5, 6, 7, 0, 1, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 7, 0, 1, 2, 3, 5, 6, 7, 0, 1, 3, 4, 5, 6, 7, 1, 2, more...

integer, non-monotonic, +, A067570 (weak, multiple)

a(n)=and(7, comp[6*n])
comp(a)=complement function of a (in range)
and(a,b)=bitwise and
n≥1
6 operations
Bitwise
a(n)=comp[6*n]%8
comp(a)=complement function of a (in range)
n≥1
6 operations
Divisibility

Sequence txtorm42pts4

0, 1, 2, 3, 4, 5, 7, 0, 2, 3, 5, 6, 0, 1, 3, 4, 6, 7, 1, 2, 4, 5, 7, 0, 2, 3, 5, 6, 0, 1, 3, 4, 6, 7, 1, 2, more...

integer, non-monotonic, +, A067570 (weak, multiple)

a(n)=and(7, comp[3*n])
comp(a)=complement function of a (in range)
and(a,b)=bitwise and
n≥2
6 operations
Bitwise
a(n)=comp[3*n]%8
comp(a)=complement function of a (in range)
n≥2
6 operations
Divisibility

Sequence vdmoqa1zlmc5g

0, 1, 2, 3, 4, 5, 7, 8, 10, 11, 12, 13, 14, 15, 16, 17, 19, 20, 22, 23, 24, 25, 26, 27, 28, 29, 31, 32, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 46, 47, 48, 49, 50, more...

integer, strictly-monotonic, +, A039262

a(n)=comp[3*or(2, n)]
or(a,b)=bitwise or
comp(a)=complement function of a (in range)
n≥0
6 operations
Bitwise
a(n)=comp[3*or(2, comp[n²])]
comp(a)=complement function of a (in range)
or(a,b)=bitwise or
n≥0
8 operations
Power

Sequence p3l15cfoentge

0, 1, 2, 3, 4, 11, 12, more...

integer, strictly-monotonic, +, A268236 (weak)

a(n)=comp[5+xor(6, n)]
xor(a,b)=bitwise exclusive or
comp(a)=complement function of a (in range)
n≥2
6 operations
Bitwise
a(n)=Ω(∏[rad(φ(n))!])
ϕ(n)=number of relative primes (Euler's totient)
rad(n)=square free kernel of n
∏(a)=partial products of a
Ω(n)=number of prime divisors of n
n≥2
6 operations
Prime
a(n)=∑[floor(τ(n^6)/7)]
τ(n)=number of divisors of n
∑(a)=partial sums of a
n≥1
8 operations
Prime
a(n)=gcd(∑[n]^a(n-2), 7)+a(n-1)
a(0)=0
a(1)=1
∑(a)=partial sums of a
gcd(a,b)=greatest common divisor
n≥2
8 operations
Recursive
a(n)=∑[σ(n^6)%σ(n)]
σ(n)=divisor sum of n
∑(a)=partial sums of a
n≥1
8 operations
Prime

Sequence afxy42egc5rgo

0, 1, 3, 4, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 31, 32, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, more...

integer, strictly-monotonic, +, A066533 (multiple)

a(n)=comp[xor(2, 7*n)]
xor(a,b)=bitwise exclusive or
comp(a)=complement function of a (in range)
n≥0
6 operations
Bitwise

Sequence alyznko2s4tmi

0, 2, 8, 15, 28, 40, 60, 77, 104, 126, 160, 187, 228, 260, 308, 345, 400, 442, 504, 551, 620, 672, 748, 805, 888, 950, 1040, 1107, 1204, 1276, 1380, 1457, 1568, 1650, more...

integer, strictly-monotonic, +

a(n)=n*comp[3*n]
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic
a(n)=n*comp[3+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
6 operations
Recursive

Sequence i2jmkekfb5cgl

0, 3, 6, 9, 12, 18, 24, 27, 30, 33, 36, 42, 48, 51, 54, 57, 60, 66, 72, 75, 78, 81, 84, 90, 96, 99, 102, 105, 108, 114, 120, 123, 126, 129, 132, 138, 144, 147, 150, more...

integer, strictly-monotonic, +, A271449 (weak, multiple)

a(n)=3*comp[or(5, n)]
or(a,b)=bitwise or
comp(a)=complement function of a (in range)
n≥0
6 operations
Bitwise

Sequence lx5as5wsc35rk

0, 4, 8, 16, 20, 24, 32, 36, 40, 48, 52, 56, 64, 68, 72, 80, 84, 88, 96, 100, 104, 112, 116, 120, 128, 132, 136, 144, 148, 152, 160, 164, 168, 176, 180, 184, 192, 196, 200, more...

integer, strictly-monotonic, +, A104235

a(n)=4*comp[or(3, n)]
or(a,b)=bitwise or
comp(a)=complement function of a (in range)
n≥0
6 operations
Bitwise
a(n)=4*comp[3+4*n]
comp(a)=complement function of a (in range)
n≥0
8 operations
Arithmetic
a(n)=4*comp[or(3, comp[n²])]
comp(a)=complement function of a (in range)
or(a,b)=bitwise or
n≥0
8 operations
Power

Sequence u2ii3uo5j3fik

1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, more...

integer, periodic-7, non-monotonic, +, A115788

a(n)=and(1, comp[8*n])
comp(a)=complement function of a (in range)
and(a,b)=bitwise and
n≥0
6 operations
Bitwise

Sequence u4kowkdbuq2vk

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, more...

integer, monotonic, +, A279758

a(n)=comp[13*n]-n
comp(a)=complement function of a (in range)
n≥0
6 operations
Arithmetic

Sequence gjay5ek0xdfuf

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 49, 50, more...

integer, strictly-monotonic, +, A253781

a(n)=comp[8*xor(1, n)]
xor(a,b)=bitwise exclusive or
comp(a)=complement function of a (in range)
n≥1
6 operations
Bitwise
a(n)=comp[Δ[or(1, n)²]]
or(a,b)=bitwise or
Δ(a)=differences of a
comp(a)=complement function of a (in range)
n≥2
6 operations
Power
a(n)=comp[n*gcd(a(n-1), 8)]
a(0)=0
gcd(a,b)=greatest common divisor
comp(a)=complement function of a (in range)
n≥1
6 operations
Recursive
a(n)=comp[lcm(comp[pt(n)], 8)]
pt(n)=Pascals triangle by rows
comp(a)=complement function of a (in range)
lcm(a,b)=least common multiple
n≥0
6 operations
Combinatoric
a(n)=comp[8*Ω(composite(n))]
composite(n)=nth composite number
Ω(n)=number of prime divisors of n
comp(a)=complement function of a (in range)
n≥1
6 operations
Prime

Sequence m3t4sgzyvxatp

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 0, 1, 2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, 0, 1, 2, more...

integer, non-monotonic, +, A290492 (multiple)

a(n)=and(15, comp[13*n])
comp(a)=complement function of a (in range)
and(a,b)=bitwise and
n≥0
6 operations
Bitwise

Sequence 2dxft0vhxzi0h

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 32, 33, 34, 35, 36, 37, 38, 40, 41, 42, 43, 44, 45, 46, 47, 32, 33, 34, more...

integer, non-monotonic, +, A290492 (multiple)

a(n)=and(47, comp[13*n])
comp(a)=complement function of a (in range)
and(a,b)=bitwise and
n≥0
6 operations
Bitwise

Sequence y5zpa5hojqurm

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

integer, strictly-monotonic, +-, A109065 (multiple)

a(n)=14-comp[and(17, n)]
and(a,b)=bitwise and
comp(a)=complement function of a (in range)
n≥0
6 operations
Bitwise

Sequence arghc1kcagq4g

46, 48, 50, 52, 54, 56, more...

integer, strictly-monotonic, +, A098194 (weak, multiple)

a(n)=n+comp[n-7]
comp(a)=complement function of a (in range)
n≥1
6 operations
Arithmetic

Sequence vbpz53r2cmdwh

46, 48, 50, 52, 54, 56, 58, more...

integer, strictly-monotonic, +, A098194 (multiple)

a(n)=n+comp[n-9]
comp(a)=complement function of a (in range)
n≥2
6 operations
Arithmetic

Sequence gfwmes4mapk5j

48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, more...

integer, strictly-monotonic, +, A121377 (multiple)

a(n)=46+comp[and(17, n)]
and(a,b)=bitwise and
comp(a)=complement function of a (in range)
n≥0
6 operations
Bitwise

Sequence t404cb3etxtlm

-2, -4, -5, -7, -8, -9, -11, -12, -13, -14, -16, -17, -18, -19, -20, -22, -23, -24, -25, -26, -27, -29, -30, -31, -32, -33, -34, -35, -37, -38, -39, -40, -41, -42, -43, -44, -46, -47, -48, -49, -50, more...

integer, strictly-monotonic, -

a(n)=-comp[∑[n]]
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
4 operations
Arithmetic
a(n)=-comp[C(n, 2)]
C(n,k)=binomial coefficient
comp(a)=complement function of a (in range)
n≥0
5 operations
Combinatoric
a(n)=-comp[n+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
5 operations
Recursive

Sequence sptafetzu0r0g

0, 1, 2, 3, 4, 7, 9, 10, 12, 13, 14, 16, 17, 18, 19, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 34, 35, 36, 37, 38, 39, 40, 42, 43, 44, 45, 46, 47, 48, 49, more...

integer, strictly-monotonic, +

a(n)=comp[n+a(n-1)]
a(0)=5
comp(a)=complement function of a (in range)
n≥0
4 operations
Recursive
a(n)=comp[5+∑[n]]
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence ry0jcpvzpmovi

0, 1, 2, 3, 6, 8, 9, 11, 12, 13, 15, 16, 17, 18, 20, 21, 22, 23, 24, 26, 27, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 50, more...

integer, strictly-monotonic, +

a(n)=comp[n+a(n-1)]
a(0)=4
comp(a)=complement function of a (in range)
n≥0
4 operations
Recursive
a(n)=comp[4+∑[n]]
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence dft4gils3uqtd

0, 1, 2, 5, 7, 8, 10, 11, 12, 14, 15, 16, 17, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, more...

integer, strictly-monotonic, +

a(n)=comp[n+a(n-1)]
a(0)=3
comp(a)=complement function of a (in range)
n≥0
4 operations
Recursive
a(n)=comp[3+∑[n]]
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence jencrzjojvfgm

0, 1, 4, 6, 7, 9, 10, 11, 13, 14, 15, 16, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 36, 37, 39, 40, 41, 42, 43, 44, 45, 46, 48, 49, 50, more...

integer, strictly-monotonic, +

a(n)=comp[n+a(n-1)]
a(0)=2
comp(a)=complement function of a (in range)
n≥0
4 operations
Recursive
a(n)=comp[2+∑[n]]
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence maimxysfotreg

0, 3, 5, 6, 8, 9, 10, 12, 13, 14, 15, 17, 18, 19, 20, 21, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 42, 43, 44, 45, 47, 48, 49, 50, more...

integer, strictly-monotonic, +

a(n)=comp[n+a(n-1)]
a(0)=1
comp(a)=complement function of a (in range)
n≥0
4 operations
Recursive
a(n)=comp[1+∑[n]]
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic
a(n)=comp[∑[C(n, a(n-1))]]
a(0)=1
C(n,k)=binomial coefficient
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Combinatoric

Sequence upv0r3fisbxtm

1, 3, 15, 105, 945, 10395, 135135, 2027025, 34459425, 654729075, 13749310575, 316234143225, 7905853580625, 213458046676875, more...

integer, strictly-monotonic, +

a(n)=∏[2+a(n-1)]
a(0)=1
∏(a)=partial products of a
n≥0
4 operations
Recursive
a(n)=∏[Δ[n²]]
Δ(a)=differences of a
∏(a)=partial products of a
n≥0
4 operations
Power
a(n)=∏[comp[2*n]]
comp(a)=complement function of a (in range)
∏(a)=partial products of a
n≥0
5 operations
Arithmetic
a(n)=∏[comp[lcm(n, 2)]]
lcm(a,b)=least common multiple
comp(a)=complement function of a (in range)
∏(a)=partial products of a
n≥0
5 operations
Divisibility

Sequence et2v4bx2gumui

-8, -6, -5, -3, -2, -1, 1, 2, 3, 4, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 34, 36, 37, 38, 39, 40, more...

integer, strictly-monotonic, +-

a(n)=comp[∑[n]]-10
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence r0wcjhccwq5uj

-7, -5, -4, -2, -1, 0, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18, 20, 21, 22, 23, 24, 25, 26, 28, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, more...

integer, strictly-monotonic, +-

a(n)=comp[∑[n]]-9
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence t0oxxzq5songh

-6, -4, -3, -1, 0, 1, 3, 4, 5, 6, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 21, 22, 23, 24, 25, 26, 27, 29, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 42, more...

integer, strictly-monotonic, +-

a(n)=comp[∑[n]]-8
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence 5hjeqgmkd0a0p

-5, -3, -2, 0, 1, 2, 4, 5, 6, 7, 9, 10, 11, 12, 13, 15, 16, 17, 18, 19, 20, 22, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 39, 40, 41, 42, 43, more...

integer, strictly-monotonic, +-

a(n)=comp[∑[n]]-7
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence 3u3if3qx3ptcp

-4, -2, -1, 1, 2, 3, 5, 6, 7, 8, 10, 11, 12, 13, 14, 16, 17, 18, 19, 20, 21, 23, 24, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 36, 37, 38, 40, 41, 42, 43, 44, more...

integer, strictly-monotonic, +-

a(n)=comp[∑[n]]-6
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence gtr5sfxi2m0ig

-3, -1, 0, 2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, more...

integer, strictly-monotonic, +-

a(n)=comp[∑[n]]-5
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence xfmofwtfauhzb

-2, 0, 1, 3, 4, 5, 7, 8, 9, 10, 12, 13, 14, 15, 16, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 40, 42, 43, 44, 45, 46, more...

integer, strictly-monotonic, +-

a(n)=comp[∑[n]]-4
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic

Sequence 1rni2uvxnrdjf

-1, -3, -4, -6, -7, -8, -10, -11, -12, -13, -15, -16, -17, -18, -19, -21, -22, -23, -24, -25, -26, -28, -29, -30, -31, -32, -33, -34, -36, -37, -38, -39, -40, -41, -42, -43, -45, -46, -47, -48, -49, more...

integer, strictly-monotonic, -

a(n)=1-comp[∑[n]]
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic
a(n)=1-comp[n+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
6 operations
Recursive

Sequence 0zjir5v3d4gmd

-1, 1, 2, 4, 5, 6, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 24, 26, 27, 28, 29, 30, 31, 32, 34, 35, 36, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, more...

integer, strictly-monotonic, +-

a(n)=comp[∑[n]]-3
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic
a(n)=comp[n+a(n-1)]-3
a(0)=0
comp(a)=complement function of a (in range)
n≥0
6 operations
Recursive

Sequence lxbcgvo4wrjnb

0, -2, -3, -5, -6, -7, -9, -10, -11, -12, -14, -15, -16, -17, -18, -20, -21, -22, -23, -24, -25, -27, -28, -29, -30, -31, -32, -33, -35, -36, -37, -38, -39, -40, -41, -42, -44, -45, -46, -47, -48, more...

integer, strictly-monotonic, -

a(n)=2-comp[∑[n]]
∑(a)=partial sums of a
comp(a)=complement function of a (in range)
n≥0
5 operations
Arithmetic
a(n)=2-comp[n+a(n-1)]
a(0)=0
comp(a)=complement function of a (in range)
n≥0
6 operations
Recursive

Sequence cxg1rte4gor1e

0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, more...

integer, periodic-4, non-monotonic, +, A166486

a(n)=char[comp[4*n]]
comp(a)=complement function of a (in range)
char(a)=characteristic function of a (in range)
n≥0
5 operations
Arithmetic

[0] [1] [2] [3] [4] ... [232]