Statistics

The database consists of 734481 generated sequences.

Sequences per function type

Constant

99 integer
1 decimal
0 periodic
100 monotonic
33 oeis
100 total

Variable

1 integer
0 decimal
0 periodic
1 monotonic
1 oeis
1 total

Arithmetic

5002 integer
12328 decimal
30 periodic
16944 monotonic
437 oeis
17330 total

Recursive

36744 integer
47237 decimal
2990 periodic
29545 monotonic
1572 oeis
83981 total

Divisibility

16789 integer
982 decimal
2418 periodic
6524 monotonic
888 oeis
17771 total

Power

25305 integer
50474 decimal
2313 periodic
38137 monotonic
1097 oeis
75779 total

Trigonometric

145 integer
6810 decimal
93 periodic
769 monotonic
30 oeis
6955 total

Combinatoric

34545 integer
8405 decimal
531 periodic
19061 monotonic
599 oeis
42950 total

Prime

387832 integer
111656 decimal
605 periodic
151329 monotonic
2413 oeis
499488 total

Operators & functions

Sequences are generated from combinations the following operators and functions

Constant

1
2
3
4
5
6
7
8
9
10
π=3.141... alias[pi]

Variable

n

Arithmetic

+
- alias[neg]
-
*
² alias[sqr]
/

Recursive

a(n-1) alias[r1]
a(n-2) alias[r2]
a(n-3) alias[r3]
stern(n)=Stern-Brocot sequence

Special

abs
floor
ceil
round
cf(n)=characteristic function (in range) alias[characteristic]
comp(n)=complement function (in range) alias[complement]

Divisibility

%
gcd(a,b)=greatest common divisor
lcm(a,b)=least common multiple

Power

sqrt
^
exp
log alias[ln]

Trigonometric

cos
sin
tan

Combinatoric

!
C(n,k)=binomial coefficient alias[binomial]
P(n)=Partition numbers alias[partition]
catalan
pt(n)=Pascals triangle by rows

Prime

p(n)=nth prime alias[prime]
composite(n)=nth composite number alias[NonPrime]
τ(n)=number of divisors of n alias[sigma_0, sigma, tau, DivisorNum]
σ(n)=divisor sum of n alias[sigma_1, DivisorSum]
ϕ(n)=number of relative primes (Euler's totient) alias[phi, EulerPhi, NumRelPrimes]
Ω(n)=max factorization terms alias[Omega, bigomega, MaxFactorizationTerms]
μ(n)=Möbius function alias[mu, MobiusMu]
λ(n)=Liouville's function alias[Liouville]
Λ(n)=Von Mangoldt's function alias[Mangoldt, lambda]
gpf(n)=greatest prime factor of n alias[gpf]
lpf(n)=least prime factor of n alias[lpf]
agc(n)=number of factorizations into prime powers (abelian group count)
ζ(n)=Riemann Zeta alias[Zeta]
Z(n)=non trivial zeros of Zeta alias[ZetaZero]