Search Results for ""

The numbers defined by the recurrence relation K_(n+1)=1+min(2K_(|_n/2_|),3K_(|_n/3_|)), with K_0=1. The first few values for n=0, 1, 2, ... are 1, 3, 3, 4, 7, 7, 7, 9, 9, ...

A figurate number which is the sum of two consecutive pyramidal numbers, O_n=P_(n-1)+P_n=1/3n(2n^2+1). (1) The first few are 1, 6, 19, 44, 85, 146, 231, 344, 489, 670, 891, ...

Vince and Bóna (2012) define an assembly tree T for a connected simple graph G on n nodes as a binary rooted tree with n leavesTree Leaf and n-1 internal nodes and satisfying ...

Define a pebbling move as a transer of two pebbles from one vertex of a graph edge to an adjacent vertex with one of the pebbles being removed in transit as a toll. The ...

A random number is a number chosen as if by chance from some specified distribution such that selection of a large set of these numbers reproduces the underlying ...

In determinant expansion by minors, the minimal number of transpositions of adjacent columns in a square matrix needed to turn the matrix representing a permutation of ...

An integer n such that 3n^3 contains three consecutive 3s in its decimal representation is called a super-3 number. The first few super-3 numbers are 261, 462, 471, 481, 558, ...

A number of the form n^...^_()_(n)n, where Knuth up-arrow notation has been used. The first few Ackermann numbers are 1^1=1, 2^^2=4, and ...

An n-digit number that is the sum of the nth powers of its digits is called an n-narcissistic number. It is also sometimes known as an Armstrong number, perfect digital ...

The nth taxicab number Ta(n) is the smallest number representable in n ways as a sum of positive cubes. The numbers derive their name from the Hardy-Ramanujan number Ta(2) = ...