Sequences
392,541 sequences
- Number of geometries for group S_n under axioms A, 2T_1, CD.A076861
Number of geometries for group S_n under axioms A, 2T_1, CD.
- Number of geometries for group S_n under axioms A, 2T_1, CD, NT.A076862
Number of geometries for group S_n under axioms A, 2T_1, CD, NT.
- n^(n-2)+(n*(n-1)/2)*(n-1)^(n-3).A076863
n^(n-2)+(n*(n-1)/2)*(n-1)^(n-3).
- Number of connected loopless multigraphs with n edges.A076864
Number of connected loopless multigraphs with n edges.
- Inverse Euler transform of 1, 1, 3, 8, 23, ... (A050535).A076865
Inverse Euler transform of 1, 1, 3, 8, 23, ... (A050535).
- Euler transform of 1, 1, 3, 8, 23, ... (A050535).A076866
Euler transform of 1, 1, 3, 8, 23, ... (A050535).
- Euler transform of 1, 3, 8, 23, ... (A050535).A076867
Euler transform of 1, 3, 8, 23, ... (A050535).
- a(n) = smallest m such that a spherical n-design with m points exists in three dimensions.A076868
a(n) = smallest m such that a spherical n-design with m points exists in three dimensions.
- Largest t such that a spherical t-design with n points exists in four dimensions.A076869
Largest t such that a spherical t-design with n points exists in four dimensions.
- a(n) = smallest m such that a spherical n-design with m points exists in four dimensions.A076870
a(n) = smallest m such that a spherical n-design with m points exists in four dimensions.
- Sum of two powerful numbers (definition (1), A001694).A076871
Sum of two powerful numbers (definition (1), A001694).
- a(n) = number of numbers <= n that are the sum of two squarefull numbers.A076872
a(n) = number of numbers <= n that are the sum of two squarefull numbers.
- Smallest prime not less than sum of first n primes.A076873
Smallest prime not less than sum of first n primes.
- a(n) = n - floor ( ( 4*n + 1 )^(1/2) ).A076874
a(n) = n - floor ( ( 4*n + 1 )^(1/2) ).
- Meandric numbers for a curve crossing two perpendicular lines at n points.A076875
Meandric numbers for a curve crossing two perpendicular lines at n points.
- Meandric numbers for a river crossing two parallel roads at n points.A076876
Meandric numbers for a river crossing two parallel roads at n points.
- a(n) = A020330(n) / n.A076877
a(n) = A020330(n) / n.
- a(n) = ceiling(n^(1/n))^n - n.A076878
a(n) = ceiling(n^(1/n))^n - n.
- In binary representation: number of substrings of n^2 having the same number of 0's and 1's as n.A076879
In binary representation: number of substrings of n^2 having the same number of 0's and 1's as n.
- Determinant of the n X n matrix M_n(i,j) = C(i+j,i) (mod 3).A076880
Determinant of the n X n matrix M_n(i,j) = C(i+j,i) (mod 3).
- pi(n) - floor(n / log(n)), where pi(n) = the number of primes <= n.A076881
pi(n) - floor(n / log(n)), where pi(n) = the number of primes <= n.
- pi(n) - ceiling(n / log(n)), where pi(n) = the number of primes <= n.A076882
pi(n) - ceiling(n / log(n)), where pi(n) = the number of primes <= n.
- Let u(0)=1, u(n) = 5/2 * floor(u(n-1)); then a(n) = (2/5)*u(n).A076883
Let u(0)=1, u(n) = 5/2 * floor(u(n-1)); then a(n) = (2/5)*u(n).
- Erroneous version of A134915.A076884
Erroneous version of A134915.
- Let u(0)=1, u(1)=1 u(n) = u(n-1) + u(n-2) - n*z where z = (5-sqrt(5))/10 =0.27..., then a(n)=floor(u(n)).A076885
Let u(0)=1, u(1)=1 u(n) = u(n-1) + u(n-2) - n*z where z = (5-sqrt(5))/10 =0.27..., then a(n)=floor(u(n)).
- Smallest palindrome with exactly n prime factors (counted with multiplicity).A076886
Smallest palindrome with exactly n prime factors (counted with multiplicity).
- Sum of divisors of nonzero palindromic numbers.A076887
Sum of divisors of nonzero palindromic numbers.
- a(n) is the number of divisors of the n-th positive palindromic number.A076888
a(n) is the number of divisors of the n-th positive palindromic number.
- Sum of aliquot divisors of palindromic numbers.A076889
Sum of aliquot divisors of palindromic numbers.
- Number of primes up to n-th palindromic number.A076890
Number of primes up to n-th palindromic number.
- a(n) = [n/1][n/2][n/3] ...[n/n] / n^(tau(n)/2).A076891
a(n) = [n/1][n/2][n/3] ...[n/n] / n^(tau(n)/2).
- Number of inequivalent ternary linear codes of length n. Also the number of nonisomorphic ternary matroids on an n-set.A076892
Number of inequivalent ternary linear codes of length n. Also the number of nonisomorphic ternary matroids on an n-set.
- Number of inequivalent linear ternary codes of length n with no zero columns. Also the number of nonisomorphic loopless ternary matroids on an n-set.A076893
Number of inequivalent linear ternary codes of length n with no zero columns. Also the number of nonisomorphic loopless ternary matroids on an n-set.
- Number of inequivalent linear projective ternary codes of length n (i.e., with distinct columns and without zero columns). Also the number of nonisomorphic simple ternary matroids on an n-set.A076894
Number of inequivalent linear projective ternary codes of length n (i.e., with distinct columns and without zero columns). Also the number of nonisomorphic simple ternary matroids on an n-set.
- a(1) = 1, a(n) = n - a(ceiling(n/2)).A076895
a(1) = 1, a(n) = n - a(ceiling(n/2)).
- a(1) = 1, a(n) = n-a(floor(2n/3)).A076896
a(1) = 1, a(n) = n-a(floor(2n/3)).
- a(1)=1, a(n)=n-a(floor(3n/4)).A076897
a(1)=1, a(n)=n-a(floor(3n/4)).
- Let u(1)=u(2)=u(3)=1, u(n)=sign(u(n-1)-u(n-2))/(u(n-3)+1); then a(n) is the numerator of u(n).A076898
Let u(1)=u(2)=u(3)=1, u(n)=sign(u(n-1)-u(n-2))/(u(n-3)+1); then a(n) is the numerator of u(n).
- Let u(1)=u(2)=u(3)=1, u(n)=sign(u(n-1)-u(n-2))/(u(n-3)+1); then a(n) is the denominator of u(n).A076899
Let u(1)=u(2)=u(3)=1, u(n)=sign(u(n-1)-u(n-2))/(u(n-3)+1); then a(n) is the denominator of u(n).
- Expansion of e.g.f.: 1/Product_{m>0} (1-x^m/(m-1)!).A076900
Expansion of e.g.f.: 1/Product_{m>0} (1-x^m/(m-1)!).
- E.g.f.: 1/Product_{m>0} (1+(-x)^m/m!).A076901
E.g.f.: 1/Product_{m>0} (1+(-x)^m/m!).
- a(1)=1, a(n) = floor(n/2) - a(floor(n/2)).A076902
a(1)=1, a(n) = floor(n/2) - a(floor(n/2)).
- Numerator of coefficients of power series for exp(exp(x)-1).A076903
Numerator of coefficients of power series for exp(exp(x)-1).
- Denominator of coefficients of power series for exp(exp(x)-1).A076904
Denominator of coefficients of power series for exp(exp(x)-1).
- a(1)=1, a(n)=n-a(n-1)+a(a(n-1))-a(a(a(n-1))).A076905
a(1)=1, a(n)=n-a(n-1)+a(a(n-1))-a(a(a(n-1))).
- Meandric numbers for a river (or directed line) crossing two perpendicular roads at n points, beginning in the (-,-) quadrant and ending in the (+,+) quadrant if n even, in the (+,-) quadrant if n odd.A076906
Meandric numbers for a river (or directed line) crossing two perpendicular roads at n points, beginning in the (-,-) quadrant and ending in the (+,+) quadrant if n even, in the (+,-) quadrant if n odd.
- Meandric numbers for a river crossing two perpendicular roads at n points, beginning in the (-,-) quadrant and ending in any quadrant.A076907
Meandric numbers for a river crossing two perpendicular roads at n points, beginning in the (-,-) quadrant and ending in any quadrant.
- Duplicate of A060345.A076908
Duplicate of A060345.
- Coefficients of 4-point function in dimension 4.A076909
Coefficients of 4-point function in dimension 4.
- Coefficients of 5-point function in dimension 5.A076910
Coefficients of 5-point function in dimension 5.