Sequences
392,541 sequences
- Number of isomorphism classes of irreducible quasiorders with n labeled points.A046911
Number of isomorphism classes of irreducible quasiorders with n labeled points.
- Number of irreducible quasiorders with n labeled points.A046912
Number of irreducible quasiorders with n labeled points.
- Sum of divisors of n not congruent to 0 mod 3.A046913
Sum of divisors of n not congruent to 0 mod 3.
- Sum of aliquot factors (divisors excluding the number itself) of 10^n.A046914
Sum of aliquot factors (divisors excluding the number itself) of 10^n.
- Sum of divisors of 10^n.A046915
Sum of divisors of 10^n.
- a(n) = n*2^n + 2*n^2 + 1.A046916
a(n) = n*2^n + 2*n^2 + 1.
- Erroneous version of A000571.A046917
Erroneous version of A000571.
- Triangle of coefficients of polynomials p(n), with p(3)=1, p(n) = (1 - t^(2*n - 4))*(1 - t^(2*n - 3))*p(n - 1)/((1 - t^(n - 3))*(1 - t^n)).A046918
Triangle of coefficients of polynomials p(n), with p(3)=1, p(n) = (1 - t^(2*n - 4))*(1 - t^(2*n - 3))*p(n - 1)/((1 - t^(n - 3))*(1 - t^n)).
- Maximal coefficient of polynomial p(n), with p(3)=1, p(n) = (1 - t^(2*n - 4))*(1 - t^(2*n - 3))*p(n - 1)/((1 - t^(n - 3))*(1 - t^n)).A046919
Maximal coefficient of polynomial p(n), with p(3)=1, p(n) = (1 - t^(2*n - 4))*(1 - t^(2*n - 3))*p(n - 1)/((1 - t^(n - 3))*(1 - t^n)).
- Number of ways to express n as p+2a^2; p = 1 or prime, a >= 0.A046920
Number of ways to express n as p+2a^2; p = 1 or prime, a >= 0.
- Number of ways to express 2n+1 as p+2a^2; p = 1 or prime, a >= 0.A046921
Number of ways to express 2n+1 as p+2a^2; p = 1 or prime, a >= 0.
- Number of ways to express n as p+2a^2; p prime, a >= 0.A046922
Number of ways to express n as p+2a^2; p prime, a >= 0.
- Number of ways to express 2n+1 as p+2a^2; p prime, a >= 0.A046923
Number of ways to express 2n+1 as p+2a^2; p prime, a >= 0.
- Number of ways to express n as p+2q; p, q = 1 or prime.A046924
Number of ways to express n as p+2q; p, q = 1 or prime.
- Number of ways to express 2n+1 as p+2q; p, q = 1 or prime.A046925
Number of ways to express 2n+1 as p+2q; p, q = 1 or prime.
- Number of ways to express n as p+2q; p, q primes.A046926
Number of ways to express n as p+2q; p, q primes.
- Number of ways to express 2n+1 as p+2q where p and q are primes.A046927
Number of ways to express 2n+1 as p+2q where p and q are primes.
- Smaller of twin prime pairs in consecutively larger seas of composite numbers.A046928
Smaller of twin prime pairs in consecutively larger seas of composite numbers.
- Width of moat of composite numbers surrounding n-th prime.A046929
Width of moat of composite numbers surrounding n-th prime.
- Size of sea of composite numbers surrounding n-th prime.A046930
Size of sea of composite numbers surrounding n-th prime.
- Prime islands: for n >= 2, a(n) = least prime whose adjacent primes are exactly 2n apart; a(1) = 3 by convention.A046931
Prime islands: for n >= 2, a(n) = least prime whose adjacent primes are exactly 2n apart; a(1) = 3 by convention.
- a(n) = period of x^n + x + 1 over GF(2), i.e., the smallest integer m>0 such that x^n + x + 1 divides x^m + 1 over GF(2).A046932
a(n) = period of x^n + x + 1 over GF(2), i.e., the smallest integer m>0 such that x^n + x + 1 divides x^m + 1 over GF(2).
- Number of composites between successive primes.A046933
Number of composites between successive primes.
- Same rule as Aitken triangle (A011971) except a(0,0)=1, a(1,0)=0.A046934
Same rule as Aitken triangle (A011971) except a(0,0)=1, a(1,0)=0.
- Sequence formed from rows of triangle A046934.A046935
Sequence formed from rows of triangle A046934.
- Same rule as Aitken triangle (A011971) except a(0,0)=0, a(1,0)=1.A046936
Same rule as Aitken triangle (A011971) except a(0,0)=0, a(1,0)=1.
- Triangle read by rows. Same rule as Aitken triangle (A011971) except T(0,0) = 1, T(1,0) = 2.A046937
Triangle read by rows. Same rule as Aitken triangle (A011971) except T(0,0) = 1, T(1,0) = 2.
- Sequence formed from rows of triangle A046937.A046938
Sequence formed from rows of triangle A046937.
- "Magic numbers" for the number of neutrons in nucleus.A046939
"Magic numbers" for the number of neutrons in nucleus.
- "Magic numbers" for the number of protons in nucleus.A046940
"Magic numbers" for the number of protons in nucleus.
- Palindromic primes whose indices n are also palindromes.A046941
Palindromic primes whose indices n are also palindromes.
- Numbers k such that k and prime(k) are both palindromes.A046942
Numbers k such that k and prime(k) are both palindromes.
- Continued fraction for Fransen-Robinson constant Integral_{x>=0} 1/Gamma(x).A046943
Continued fraction for Fransen-Robinson constant Integral_{x>=0} 1/Gamma(x).
- Number of self-avoiding walks of length n on the Laves graph.A046944
Number of self-avoiding walks of length n on the Laves graph.
- Number of self-avoiding walks of length n on hypertriangular lattice.A046945
Number of self-avoiding walks of length n on hypertriangular lattice.
- Sin(n) decreases monotonically to 0.A046946
Sin(n) decreases monotonically to 0.
- Numbers k such that |sin(k)| (or |tan(k)| or |sec(k)|) decreases monotonically to 0; also |cos(k)| (or |cosec(k)| or |cot(k)|) increases.A046947
Numbers k such that |sin(k)| (or |tan(k)| or |sec(k)|) decreases monotonically to 0; also |cos(k)| (or |cosec(k)| or |cot(k)|) increases.
- Sizes of successive balls in E_8 lattice.A046948
Sizes of successive balls in E_8 lattice.
- Sizes of successive balls in D_4 lattice.A046949
Sizes of successive balls in D_4 lattice.
- Square elements of A046949.A046950
Square elements of A046949.
- a(n) is the number of squares dividing n.A046951
a(n) is the number of squares dividing n.
- Sets record for f(n) = |{(a,b):a*b=n and a|b}|. Also squares of highly composite numbers A002182.A046952
Sets record for f(n) = |{(a,b):a*b=n and a|b}|. Also squares of highly composite numbers A002182.
- Numbers k such that 6*k - 1 is composite.A046953
Numbers k such that 6*k - 1 is composite.
- Numbers k such that 6*k + 1 is nonprime.A046954
Numbers k such that 6*k + 1 is nonprime.
- Numbers k such that sec(k) decreases monotonically to 1 (or cos(k) increases to 1).A046955
Numbers k such that sec(k) decreases monotonically to 1 (or cos(k) increases to 1).
- Numbers k where tan(k) decreases monotonically to 0 (or cot(k) increases).A046956
Numbers k where tan(k) decreases monotonically to 0 (or cot(k) increases).
- Numbers k where cos(k) decreases monotonically to 0.A046957
Numbers k where cos(k) decreases monotonically to 0.
- Theta series of 14-dimensional integral laminated lattice LAMBDA14.2 with minimal norm 4.A046958
Theta series of 14-dimensional integral laminated lattice LAMBDA14.2 with minimal norm 4.
- Numbers k where sin(k) increases monotonically to 1 (or cosec(k) decreases).A046959
Numbers k where sin(k) increases monotonically to 1 (or cosec(k) decreases).
- Bessel function J_0(n) is a monotonically decreasing positive sequence.A046960
Bessel function J_0(n) is a monotonically decreasing positive sequence.