Search Results for ""
401 - 410 of 13135 for Happy NumberSearch Results
By way of analogy with the eban numbers, uban numbers are defined as numbers whose English names do not contain the letter "u" (i.e., "u" is banned). Note that this ...
The tetranacci numbers are a generalization of the Fibonacci numbers defined by T_0=0, T_1=1, T_2=1, T_3=2, and the recurrence relation T_n=T_(n-1)+T_(n-2)+T_(n-3)+T_(n-4) ...
A member of the smallest algebraically closed subfield L of C which is closed under the exponentiation and logarithm operations.
An integer is k-smooth if it has no prime factors >k. The following table gives the first few k-smooth numbers for small k. Berndt (1994, p. 52) called the 7-smooth numbers ...
Let I(x,y) denote the set of all vertices lying on an (x,y)-graph geodesic in G, then a set S with I(S)=V(G) is called a geodetic set in G and is denoted g(G).
The secant numbers S_k, also called the zig numbers or the Euler numbers E_n^*=|E_(2n)| numbers than can be defined either in terms of a generating function given as the ...
The numbers lambda_(nun) in the Gaussian quadrature formula Q_n(f)=sum_(nu=1)^nlambda_(nun)f(x_(nun)).
The numbers B_(n,k)(1!,2!,3!,...)=(n-1; k-1)(n!)/(k!), where B_(n,k) is a Bell polynomial.
Given a Euclidean n-space, H_n=n+1.
The first few numbers not known to produce palindromes when applying the 196-algorithm (i.e., a reverse-then-add sequence) are sometimes known as Lychrel numbers. This term ...
...
View search results from all Wolfram sites (50876 matches)

