Sequences
392,541 sequences
- Numbers in which starting from most significant digit the n-th digit is obtained by adding n to the (n-1)-st digit (the digit to the left of it) and then ignoring the carry. Alternately the n-th digit starting from the most significant digit is the n-th triangular number mod 10.A069511
Numbers in which starting from most significant digit the n-th digit is obtained by adding n to the (n-1)-st digit (the digit to the left of it) and then ignoring the carry. Alternately the n-th digit starting from the most significant digit is the n-th triangular number mod 10.
- Geometric mean of digits = 2 and digits are in nondecreasing order.A069512
Geometric mean of digits = 2 and digits are in nondecreasing order.
- Characteristic function of the prime powers p^k, k >= 1.A069513
Characteristic function of the prime powers p^k, k >= 1.
- Numbers n such that sigma(reversal(n)) = reversal(sigma(n)). Ignore leading 0's.A069514
Numbers n such that sigma(reversal(n)) = reversal(sigma(n)). Ignore leading 0's.
- Number of transpositions (interchanges of adjacent digits, sometimes called inversions) needed to change all n-digit base 3 numbers into nondecreasing order.A069515
Number of transpositions (interchanges of adjacent digits, sometimes called inversions) needed to change all n-digit base 3 numbers into nondecreasing order.
- Geometric mean of digits = 3 and digits are in nondecreasing order.A069516
Geometric mean of digits = 3 and digits are in nondecreasing order.
- a(n) = (-1)*Sum_{d|n} (moebius(d)*(-1)^d).A069517
a(n) = (-1)*Sum_{d|n} (moebius(d)*(-1)^d).
- Geometric mean of digits = 4 and digits are in nondecreasing order.A069518
Geometric mean of digits = 4 and digits are in nondecreasing order.
- Numbers k such that 1/(Sum_{d|k} (-1)^d/d) is an integer.A069519
Numbers k such that 1/(Sum_{d|k} (-1)^d/d) is an integer.
- Numbers k such that (1/k) * Sum_{d|k} d*sigma(d) is an integer.A069520
Numbers k such that (1/k) * Sum_{d|k} d*sigma(d) is an integer.
- Smallest multiple of n with digit sum = 2, or 0 if no such number exists, e.g., a(3k)=0.A069521
Smallest multiple of n with digit sum = 2, or 0 if no such number exists, e.g., a(3k)=0.
- Smallest multiple of n with digit sum = 3, or 0 if no such number exists, e.g. a(9k)= 0 = a(11k).A069522
Smallest multiple of n with digit sum = 3, or 0 if no such number exists, e.g. a(9k)= 0 = a(11k).
- Smallest multiple of n with digit sum = 4, or 0 if no such number exists, e.g. a(3k)= 0.A069523
Smallest multiple of n with digit sum = 4, or 0 if no such number exists, e.g. a(3k)= 0.
- Smallest multiple of n with digit sum = 5, or 0 if no such number exists, e.g. a(3k) = a(11k) = 0.A069524
Smallest multiple of n with digit sum = 5, or 0 if no such number exists, e.g. a(3k) = a(11k) = 0.
- Smallest multiple of n with digit sum = 6, or 0 if no such number exists, e.g. a(9k)= 0.A069525
Smallest multiple of n with digit sum = 6, or 0 if no such number exists, e.g. a(9k)= 0.
- Smallest multiple of n with digit sum = 7, or 0 if no such number exists, e.g. a(3k)= a(11k) = 0.A069526
Smallest multiple of n with digit sum = 7, or 0 if no such number exists, e.g. a(3k)= a(11k) = 0.
- Smallest multiple of n with digit sum = 8, or 0 if no such number exists, e.g. a(3k)= 0.A069527
Smallest multiple of n with digit sum = 8, or 0 if no such number exists, e.g. a(3k)= 0.
- Smallest multiple of n with digit sum = 9, or 0 if no such number exists (e.g., a(11k) = 0).A069528
Smallest multiple of n with digit sum = 9, or 0 if no such number exists (e.g., a(11k) = 0).
- Smallest multiple of n with digit sum = 10, or 0 if no such number exists, e.g. a(3k)= 0.A069529
Smallest multiple of n with digit sum = 10, or 0 if no such number exists, e.g. a(3k)= 0.
- Smallest multiple of n with digit sum = 11, or 0 if no such number exists.A069530
Smallest multiple of n with digit sum = 11, or 0 if no such number exists.
- Smallest positive k such that 10^k + 1 is divisible by n, or 0 if no such number exists.A069531
Smallest positive k such that 10^k + 1 is divisible by n, or 0 if no such number exists.
- Smallest even number with digit sum n.A069532
Smallest even number with digit sum n.
- a(n) = Sum_{p prime} floor(n^2/p^2) where the sum is over all the primes.A069533
a(n) = Sum_{p prime} floor(n^2/p^2) where the sum is over all the primes.
- Smallest multiple of 5 with digit sum n.A069534
Smallest multiple of 5 with digit sum n.
- Treated as strings, n and its reversal are substrings of n!.A069535
Treated as strings, n and its reversal are substrings of n!.
- Smallest multiple of 8 with digit sum n.A069536
Smallest multiple of 8 with digit sum n.
- Multiples of 2 whose digit sum is 2.A069537
Multiples of 2 whose digit sum is 2.
- Duplicate of A052217.A069538
Duplicate of A052217.
- Duplicate of A063997.A069539
Duplicate of A063997.
- Multiples of 5 with digit sum 5.A069540
Multiples of 5 with digit sum 5.
- Duplicate of A062768.A069541
Duplicate of A062768.
- Duplicate of A063416.A069542
Duplicate of A063416.
- Multiples of 8 with digit sum 8.A069543
Multiples of 8 with digit sum 8.
- Continued fraction for Feigenbaum's constant - 4 = 0.6692...A069544
Continued fraction for Feigenbaum's constant - 4 = 0.6692...
- Liouville clusters: the number of successive occurrences of signs in Liouville function lambda(k); a(2n-1) is number of successive positive signs, while a(2n) is number of successive negative signs.A069545
Liouville clusters: the number of successive occurrences of signs in Liouville function lambda(k); a(2n-1) is number of successive positive signs, while a(2n) is number of successive negative signs.
- a(n) = Sum_{d|n} sigma(n*d).A069546
a(n) = Sum_{d|n} sigma(n*d).
- a(n) = n^2 mod n-th prime.A069547
a(n) = n^2 mod n-th prime.
- Primes of the form sum 6d/(2 + mu(d)) for some k and all d dividing k.A069548
Primes of the form sum 6d/(2 + mu(d)) for some k and all d dividing k.
- Smallest composite k such that phi(k) > k*(1-1/n).A069549
Smallest composite k such that phi(k) > k*(1-1/n).
- Squarefree part of n equals bigomega(n).A069550
Squarefree part of n equals bigomega(n).
- Numbers k such that the squarefree part of k equals A062799(k).A069551
Numbers k such that the squarefree part of k equals A062799(k).
- Numbers k such that phi(k) = sigma(core(k)) where phi(k) is the Euler totient function, sigma(k) the sum of divisors of k and core(k) the squarefree part of k (the smallest integer such that k*core(k) is a square).A069552
Numbers k such that phi(k) = sigma(core(k)) where phi(k) is the Euler totient function, sigma(k) the sum of divisors of k and core(k) the squarefree part of k (the smallest integer such that k*core(k) is a square).
- Define S(k) to be the sequence of divisors and multiples of k, e.g. S(1) = 1,2,3,4,5... S(2) = 1,2,4,6,8,10,... S(10) = 1,2,5,10,20,30,40,50,...; a(n) = n-th term of the n-th sequence S(n).A069553
Define S(k) to be the sequence of divisors and multiples of k, e.g. S(1) = 1,2,3,4,5... S(2) = 1,2,4,6,8,10,... S(10) = 1,2,5,10,20,30,40,50,...; a(n) = n-th term of the n-th sequence S(n).
- Smallest k > 0 with gcd(k, rev(k)) = n, where rev(k) is digit reversal of k, or 0 if no such k exists.A069554
Smallest k > 0 with gcd(k, rev(k)) = n, where rev(k) is digit reversal of k, or 0 if no such k exists.
- a(n) = smallest non-palindromic number k such that k and its digit reversal are divisible by n, or 0 if n is a multiple of 10.A069555
a(n) = smallest non-palindromic number k such that k and its digit reversal are divisible by n, or 0 if n is a multiple of 10.
- Primes in which the k-th digit (counting from the right) is either a nonzero multiple of k or a divisor of k; furthermore the digit 1 is allowed only when k has no other divisors < 10.A069556
Primes in which the k-th digit (counting from the right) is either a nonzero multiple of k or a divisor of k; furthermore the digit 1 is allowed only when k has no other divisors < 10.
- Squares in which the k-th significant digit either divides k or is a multiple of k. Is 1 only in case k has no other single-digit divisor.A069557
Squares in which the k-th significant digit either divides k or is a multiple of k. Is 1 only in case k has no other single-digit divisor.
- Triangular numbers in which the k-th digit, numbering them from right to left, either divides k or is a nonzero multiple of k. Is 1 only when k has no other single-digit divisor (less than 10).A069558
Triangular numbers in which the k-th digit, numbering them from right to left, either divides k or is a nonzero multiple of k. Is 1 only when k has no other single-digit divisor (less than 10).
- Triangular numbers in which the k-th significant digit either divides k or is a multiple of k.A069559
Triangular numbers in which the k-th significant digit either divides k or is a multiple of k.
- Squares in which the k-th significant digit either divides k or is a multiple of k.A069560
Squares in which the k-th significant digit either divides k or is a multiple of k.