Sequences
392,541 sequences
- Duplicate of A066578.A080461
Duplicate of A066578.
- Define f(k) = floor(k/ sum of the digits of k). Let f(f(...(n))) = m where m is divisible by the sum of the digits of m. Then a(n)= one more than the least number of steps to obtain m.A080462
Define f(k) = floor(k/ sum of the digits of k). Let f(f(...(n))) = m where m is divisible by the sum of the digits of m. Then a(n)= one more than the least number of steps to obtain m.
- Sum of the two numbers formed by alternate digits of n.A080463
Sum of the two numbers formed by alternate digits of n.
- Product of the two numbers formed by alternate digits of n.A080464
Product of the two numbers formed by alternate digits of n.
- Absolute difference between the two numbers formed by alternate digits of n.A080465
Absolute difference between the two numbers formed by alternate digits of n.
- Multiples of 11 in which the even positioned digits from left are even and the odd positioned ones are odd.A080466
Multiples of 11 in which the even positioned digits from left are even and the odd positioned ones are odd.
- Multiples of 11 in which the even positioned digits from left are odd and the odd positioned ones are even.A080467
Multiples of 11 in which the even positioned digits from left are odd and the odd positioned ones are even.
- a(n) = A080578(n)-2n.A080468
a(n) = A080578(n)-2n.
- Composite numbers k such that binomial(3*k, k) == 3^k (mod k).A080469
Composite numbers k such that binomial(3*k, k) == 3^k (mod k).
- a(n) = smallest composite number that is obtained by placing digits anywhere in n; a(n) = n if n is composite.A080470
a(n) = smallest composite number that is obtained by placing digits anywhere in n; a(n) = n if n is composite.
- a(n) is the smallest Fibonacci number that is obtained by placing digits anywhere in n; a(n) = n if n is a Fibonacci number.A080471
a(n) is the smallest Fibonacci number that is obtained by placing digits anywhere in n; a(n) = n if n is a Fibonacci number.
- a(n) = smallest triangular number that is obtained by placing digits anywhere in n; a(n) = n if n is a triangular number.A080472
a(n) = smallest triangular number that is obtained by placing digits anywhere in n; a(n) = n if n is a triangular number.
- a(n) = sum of the products of taking n-1 numbers from the next n numbers. The next n numbers can be grouped like this (1), (2,3), (4,5,6), (7,8,9,10),... and a(n) is the (sum of the reciprocals of all members) multiplied by (the product of all members).A080473
a(n) = sum of the products of taking n-1 numbers from the next n numbers. The next n numbers can be grouped like this (1), (2,3), (4,5,6), (7,8,9,10),... and a(n) is the (sum of the reciprocals of all members) multiplied by (the product of all members).
- a(n) = product of sum of taking n-1 numbers from the next n numbers. The next n numbers can be grouped like this (1), (2,3), (4,5,6), (7,8,9,10),... . Let N be the sum of all the members of the n-th group. Let k be a member and f(k) = N - k. Then a(n) = the product of all f(k) for k taking all member values.A080474
a(n) = product of sum of taking n-1 numbers from the next n numbers. The next n numbers can be grouped like this (1), (2,3), (4,5,6), (7,8,9,10),... . Let N be the sum of all the members of the n-th group. Let k be a member and f(k) = N - k. Then a(n) = the product of all f(k) for k taking all member values.
- Integers not expressible as the sum of a brilliant number and a prime.A080475
Integers not expressible as the sum of a brilliant number and a prime.
- Floor( geometric mean of next n numbers ).A080476
Floor( geometric mean of next n numbers ).
- Weight distribution of [120,60,20] double circulant code.A080477
Weight distribution of [120,60,20] double circulant code.
- Square roots of A062067(n).A080478
Square roots of A062067(n).
- Smallest number formed by using all the digits (with multiplicity) of next n numbers.A080479
Smallest number formed by using all the digits (with multiplicity) of next n numbers.
- Largest number formed by using all the digits (with multiplicity) of next n numbers.A080480
Largest number formed by using all the digits (with multiplicity) of next n numbers.
- Concatenation of next n numbers (a(1) = 0).A080481
Concatenation of next n numbers (a(1) = 0).
- a(n) = A080481(n)/3.A080482
a(n) = A080481(n)/3.
- Reverse concatenation of next n numbers with a(1) = 0.A080483
Reverse concatenation of next n numbers with a(1) = 0.
- a(n) = A080483(n)/3.A080484
a(n) = A080483(n)/3.
- a(1) = 1; thereafter a(n) = a(n-1) + a(n-1)^(n-1).A080485
a(1) = 1; thereafter a(n) = a(n-1) + a(n-1)^(n-1).
- a(1) = 1, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).A080486
a(1) = 1, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).
- a(1) =2, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).A080487
a(1) =2, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).
- a(1) =3, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).A080488
a(1) =3, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).
- a(1) =4, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).A080489
a(1) =4, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).
- a(1) =5, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).A080490
a(1) =5, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).
- a(1) =6, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).A080491
a(1) =6, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).
- a(1) =7, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).A080492
a(1) =7, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).
- a(1) =8, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).A080493
a(1) =8, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).
- a(1) =9, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).A080494
a(1) =9, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1).
- a(1) = 1, a(2) = 12, a(n) = smallest multiple of a(n-1) beginning with the least significant digit of a(n-1).A080495
a(1) = 1, a(2) = 12, a(n) = smallest multiple of a(n-1) beginning with the least significant digit of a(n-1).
- a(n) = A080495(n+1)/A080495(n).A080496
a(n) = A080495(n+1)/A080495(n).
- a(n) = (n-p_1)(n-p_2)...(n-p_k) where p_k is the k-th prime and is also the largest prime < n.A080497
a(n) = (n-p_1)(n-p_2)...(n-p_k) where p_k is the k-th prime and is also the largest prime < n.
- a(n) = (n-c_1)(n-c_2)...(n-c_k) where c_k is the k-th composite number and is also the largest composite number < n.A080498
a(n) = (n-c_1)(n-c_2)...(n-c_k) where c_k is the k-th composite number and is also the largest composite number < n.
- Duplicate of A072513.A080499
Duplicate of A072513.
- a(n) = (n-1)(n-4)(n-9)...(n-k^2) where k^2 < n <= (k+1)^2.A080500
a(n) = (n-1)(n-4)(n-9)...(n-k^2) where k^2 < n <= (k+1)^2.
- Let f(n) be the smallest multiple of n that can be obtained by inserting digits anywhere in n except that f(n) is not equal to 10*n; a(n) = f(n)/n.A080501
Let f(n) be the smallest multiple of n that can be obtained by inserting digits anywhere in n except that f(n) is not equal to 10*n; a(n) = f(n)/n.
- a(1) = 1, a(n) = smallest multiple of n that can be obtained by inserting digits anywhere in a(n-1) if necessary.A080502
a(1) = 1, a(n) = smallest multiple of n that can be obtained by inserting digits anywhere in a(n-1) if necessary.
- a(n) = A080502(n)/n.A080503
a(n) = A080502(n)/n.
- Triangle whose n-th row contains the least set (ordered lexicographically) of n distinct positive integers whose arithmetic and geometric means are both integers.A080504
Triangle whose n-th row contains the least set (ordered lexicographically) of n distinct positive integers whose arithmetic and geometric means are both integers.
- Last term in n-th row of A080504.A080505
Last term in n-th row of A080504.
- Geometric mean of n-th row of A080504.A080506
Geometric mean of n-th row of A080504.
- Arithmetic mean of n-th row of A080504.A080507
Arithmetic mean of n-th row of A080504.
- Triangle whose n-th row contains the least set (ordered lexicographically) of n distinct positive integers whose geometric mean is an integer.A080508
Triangle whose n-th row contains the least set (ordered lexicographically) of n distinct positive integers whose geometric mean is an integer.
- Last term in n-th row of A080508.A080509
Last term in n-th row of A080508.
- Triangle read by rows: T(n,k) gives the number of set partitions of {1,...,n} with maximum block length k.A080510
Triangle read by rows: T(n,k) gives the number of set partitions of {1,...,n} with maximum block length k.