Search Results for ""
1101 - 1110 of 5121 for Odd/even/prime/composite/square numbersSearch Results
The Copeland-Erdős constant is the constant with decimal expansion 0.23571113171923... (OEIS A033308) obtained by concatenating consecutive primes: 2, 23, 235, 2357, 235711, ...
A graph is said to be regular of degree r if all local degrees are the same number r. A 0-regular graph is an empty graph, a 1-regular graph consists of disconnected edges, ...
A Dirichlet L-series is a series of the form L_k(s,chi)=sum_(n=1)^inftychi_k(n)n^(-s), (1) where the number theoretic character chi_k(n) is an integer function with period k, ...
A parallelogram polyomino is a polyomino such that the intersection with every line perpendicular to the main diagonal is a connected segment. The number of parallelogram ...
Prellberg (2001) noted that the limit c=lim_(n->infty)(T_n)/(B_nexp{1/2[W(n)]^2})=2.2394331040... (OEIS A143307) exists, where T_n is a Takeuchi number, B_n is a Bell number, ...
The Paley graph of order q with q a prime power is a graph on q nodes with two nodes adjacent if their difference is a square in the finite field GF(q). This graph is ...
Let the stick number s(K) of a knot K be the least number of straight sticks needed to make a knot K. The smallest stick number of any knot is s(T)=6, where T is the trefoil ...
Given a Lucas sequence with parameters P and Q, discriminant D!=0, and roots a and b, the Sylvester cyclotomic numbers are Q_n=product_(r)(a-zeta^rb), (1) where ...
The mathematical golden rule states that, for any fraction, both numerator and denominator may be multiplied by the same number without changing the fraction's value.
A type of diagram invented by Lewis Carroll (the name is an abbreviation of "Lewis") that can be used to determine the number of minimal covers of n numbers with k members.
...