Search Results for ""
51 - 60 of 1602 for Inline 13Search Results
A function, or the symbol representing a function, which corresponds to English conjunctions such as "and," "or," "not," etc. that takes one or more truth values as input and ...
An emirp ("prime" spelled backwards) is a prime whose (base 10) reversal is also prime, but which is not a palindromic prime. The first few are 13, 17, 31, 37, 71, 73, 79, ...
A number n is called equidigital if the number of digits in the prime factorization of n (including powers) uses the same number of digits as the number of digits in n. The ...
The sequence of numbers obtained by letting a_1=2, and defining a_n=lpf(1+product_(k=1)^(n-1)a_k) where lpf(n) is the least prime factor. The first few terms are 2, 3, 7, 43, ...
An odious number is a nonnegative number that has an odd number of 1s in its binary expansion. The first few odious numbers are therefore 1, 2, 4, 7, 8, 11, 13, 14, 16, 19, ...
A polyhedron or plane tessellation is called semiregular if its faces are all regular polygons and its corners are alike (Walsh 1972; Coxeter 1973, pp. 4 and 58; Holden 1991, ...
The tangram is a combination of plane polygonal pieces such that the edges of the polygons are coincident. There are 13 convex tangrams (where a "convex tangram" is a set of ...
A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...
A graph whose nodes are sequences of symbols from some alphabet and whose edges indicate the sequences which might overlap. The above figures show the first few n-dimensional ...
Campbell (2022) used the WZ method to obtain the sum (pi^2)/4=sum_(n=1)^infty(16^n(n+1)(3n+1))/(n(2n+1)^2(2n; n)^3), (1) where (n; k) is a binomial coefficient. There is a ...
...
View search results from all Wolfram sites (95042 matches)

