Sequences
392,541 sequences
- Expansion of Molien series for a certain 4-D group of order 48.A078411
Expansion of Molien series for a certain 4-D group of order 48.
- a(0) = 5, a(1) = 8; for n >1, a(n)=(a(n-1)+a(n-2))/3^n, where 3^n is the highest power of 3 dividing a(n-1)+a(n-2).A078412
a(0) = 5, a(1) = 8; for n >1, a(n)=(a(n-1)+a(n-2))/3^n, where 3^n is the highest power of 3 dividing a(n-1)+a(n-2).
- Smallest positive integer than cannot be obtained from exactly n copies of n using parentheses and the operations +, -, /, *, ^ and concatenation.A078413
Smallest positive integer than cannot be obtained from exactly n copies of n using parentheses and the operations +, -, /, *, ^ and concatenation.
- a(n) = (a(n-1)+a(n-2))/7^k, where 7^k is the highest power of 7 dividing a(n-1)+a(n-2).A078414
a(n) = (a(n-1)+a(n-2))/7^k, where 7^k is the highest power of 7 dividing a(n-1)+a(n-2).
- Let f(n) = fraction of digits that are nonzero when n is written in base 2 and g(n) the same fraction for base 3. Let h(n) = max {f(n), g(n)}. Sequence gives n for which h(n) sets a new low record.A078415
Let f(n) = fraction of digits that are nonzero when n is written in base 2 and g(n) the same fraction for base 3. Let h(n) = max {f(n), g(n)}. Sequence gives n for which h(n) sets a new low record.
- Decimal expansion of Viswanath's constant.A078416
Decimal expansion of Viswanath's constant.
- Numbers k such that h(k) = h(k+1), where h(k) is the length of k, f(k), f(f(k)), ..., 1 in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)A078417
Numbers k such that h(k) = h(k+1), where h(k) is the length of k, f(k), f(f(k)), ..., 1 in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)
- Numbers k such that h(k) = h(k-1) + h(k-2), where h(k) = A006577(k) + 1 is the length of the sequence {k, f(k), f(f(k)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)A078418
Numbers k such that h(k) = h(k-1) + h(k-2), where h(k) = A006577(k) + 1 is the length of the sequence {k, f(k), f(f(k)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)
- Numbers n such that h(n) = 2 h(n-1) where h(n) is the length of the sequence {n, f(n), f(f(n)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)A078419
Numbers n such that h(n) = 2 h(n-1) where h(n) is the length of the sequence {n, f(n), f(f(n)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)
- Numbers n such that h(n) = 3 h(n-1) where h(n) is the length of the sequence {n, f(n), f(f(n)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)A078420
Numbers n such that h(n) = 3 h(n-1) where h(n) is the length of the sequence {n, f(n), f(f(n)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)
- Least positive integer solution k to h(k) = n h(k-1), where h(n) is the length of n, f(n), f(f(n)), ...., 1 in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)A078421
Least positive integer solution k to h(k) = n h(k-1), where h(n) is the length of n, f(n), f(f(n)), ...., 1 in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)
- a(n) = prime(n+1)^prime(n).A078422
a(n) = prime(n+1)^prime(n).
- Group the natural numbers into clumps with increasing prime numbers of elements, then multiply the members of each clump.A078423
Group the natural numbers into clumps with increasing prime numbers of elements, then multiply the members of each clump.
- Mix digits of Pi, e and phi.A078424
Mix digits of Pi, e and phi.
- Primes in "Ulam's Prime sequence". A prime is in the sequence iff p+1 can be expressed in exactly 1 way as the sum of 2 previous distinct primes.A078425
Primes in "Ulam's Prime sequence". A prime is in the sequence iff p+1 can be expressed in exactly 1 way as the sum of 2 previous distinct primes.
- Numbers k such that there is no solution to the equation sigma(x) = 2^k, where sigma(x) denotes the sum of the divisors of x.A078426
Numbers k such that there is no solution to the equation sigma(x) = 2^k, where sigma(x) denotes the sum of the divisors of x.
- Sum of all the decimal digits of numbers from 1 to 10^n.A078427
Sum of all the decimal digits of numbers from 1 to 10^n.
- Partial sums of A035187.A078428
Partial sums of A035187.
- Number of integers k among 1..n for which gcd(k,n) is a cube.A078429
Number of integers k among 1..n for which gcd(k,n) is a cube.
- Sum of gcd(k^2,n) for 1 <= k <= n.A078430
Sum of gcd(k^2,n) for 1 <= k <= n.
- Number of permutations p of 1,2,...,n such that both numerator and denominator of the continued fraction [p(1); p(2),...,p(n)] are primes.A078431
Number of permutations p of 1,2,...,n such that both numerator and denominator of the continued fraction [p(1); p(2),...,p(n)] are primes.
- Number of permutations p of 1,2,...,n such that the denominator of the continued fraction [p(1); p(2),...,p(n)] is prime.A078432
Number of permutations p of 1,2,...,n such that the denominator of the continued fraction [p(1); p(2),...,p(n)] is prime.
- Number of permutations p of 1,2,...,n such that the numerator of the continued fraction [p(1); p(2),...,p(n)] is prime.A078433
Number of permutations p of 1,2,...,n such that the numerator of the continued fraction [p(1); p(2),...,p(n)] is prime.
- Decimal expansion of zeta(3/2).A078434
Decimal expansion of zeta(3/2).
- Number of composites <= n^2.A078435
Number of composites <= n^2.
- Triangle read by rows in which n-th row counts multisets associated with hook partitions.A078436
Triangle read by rows in which n-th row counts multisets associated with hook partitions.
- Decimal expansion of sum of alternating series of reciprocals of primes.A078437
Decimal expansion of sum of alternating series of reciprocals of primes.
- a(n) = least positive integer solution k to h(k) = h(k-1)+h(k-2)+...+h(k-n), where h(n) is the length of n, f(n), f(f(n)), ...., 1 in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)A078438
a(n) = least positive integer solution k to h(k) = h(k-1)+h(k-2)+...+h(k-n), where h(n) is the length of n, f(n), f(f(n)), ...., 1 in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)
- a(n) = Sum_{k=1..n} gcd(k,n)*mu(gcd(k,n))^2.A078439
a(n) = Sum_{k=1..n} gcd(k,n)*mu(gcd(k,n))^2.
- Numbers n with property that n is not a power of 2 and the finite sequence n, f(n), f(f(n)), ...., 1 in the Collatz (or 3x + 1) problem contains exactly one prime. (The earliest "1" is meant.)A078440
Numbers n with property that n is not a power of 2 and the finite sequence n, f(n), f(f(n)), ...., 1 in the Collatz (or 3x + 1) problem contains exactly one prime. (The earliest "1" is meant.)
- a(n) begins the first chain of n consecutive positive integers that have equal h-values, where h(k) is the length of the finite sequence k, f(k), f(f(k)), ...., 1 in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)A078441
a(n) begins the first chain of n consecutive positive integers that have equal h-values, where h(k) is the length of the finite sequence k, f(k), f(f(k)), ...., 1 in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)
- a(p) = a(n) + 1 if p is the n-th prime, prime(n); a(n)=0 if n is not prime.A078442
a(p) = a(n) + 1 if p is the n-th prime, prime(n); a(n)=0 if n is not prime.
- Numbers which are both interprime and semiprime.A078443
Numbers which are both interprime and semiprime.
- Floor of geometric mean of two consecutive primes.A078444
Floor of geometric mean of two consecutive primes.
- Primes in A060620, i.e., primes which are integer parts of averages of initial primes.A078445
Primes in A060620, i.e., primes which are integer parts of averages of initial primes.
- a(1)=a(2)=1; a(n)=a(n-2)/2 if a(n-2) is even, a(n)=a(n-1)+a(n-2) otherwise.A078446
a(1)=a(2)=1; a(n)=a(n-2)/2 if a(n-2) is even, a(n)=a(n-1)+a(n-2) otherwise.
- Final terms of rows of A078448.A078447
Final terms of rows of A078448.
- Triangle T(n,k) for 1 <= n, 1 <= k <= n read by rows: T(1,1) = 1; for n > 1: T(n,1) = T(n-1,n-1) + 1; for n > 1 and k <=n: T(n,k) = smallest number > T(n,k-1) which is relatively prime to T(n,j) for 1 <= j < k.A078448
Triangle T(n,k) for 1 <= n, 1 <= k <= n read by rows: T(1,1) = 1; for n > 1: T(n,1) = T(n-1,n-1) + 1; for n > 1 and k <=n: T(n,k) = smallest number > T(n,k-1) which is relatively prime to T(n,j) for 1 <= j < k.
- a(n) = sum of terms in n-th row of A078448.A078449
a(n) = sum of terms in n-th row of A078448.
- a(n) = product of terms in n-th row of A078448.A078450
a(n) = product of terms in n-th row of A078448.
- a(1)=1, a(n) = ceiling(n/a(a(n-1))).A078451
a(1)=1, a(n) = ceiling(n/a(a(n-1))).
- a(1)=1, a(n) = ceiling(n/a(a(a(n-1)))).A078452
a(1)=1, a(n) = ceiling(n/a(a(a(n-1)))).
- Numbers in which all the digits are coprime to each other.A078453
Numbers in which all the digits are coprime to each other.
- Index of the first occurrence of prime(n) in A060324.A078454
Index of the first occurrence of prime(n) in A060324.
- a(1) = 2. For n>1, a(n) = smallest m such that m == 0 (mod prime(n)), m + 1 == 0 (mod prime(n+1)) and m-1 == 0 (mod prime(n-1)).A078455
a(1) = 2. For n>1, a(n) = smallest m such that m == 0 (mod prime(n)), m + 1 == 0 (mod prime(n+1)) and m-1 == 0 (mod prime(n-1)).
- Number of numbers less than prime(1)*...*prime(n) having exactly one prime factor among (prime(1),...,prime(n)) where prime(n) is the n-th prime.A078456
Number of numbers less than prime(1)*...*prime(n) having exactly one prime factor among (prime(1),...,prime(n)) where prime(n) is the n-th prime.
- a(n) = least positive k such that the remainder when 3^k is divided by k is n.A078457
a(n) = least positive k such that the remainder when 3^k is divided by k is n.
- Total number of factors in a factorization of n into Gaussian primes.A078458
Total number of factors in a factorization of n into Gaussian primes.
- Numbers n such that in some base b <= log n the sum of the digits of n in base b equals b.A078459
Numbers n such that in some base b <= log n the sum of the digits of n in base b equals b.
- Initial n digits in decimal portion of the Traveling Salesman constant (A073008) form a prime number.A078460
Initial n digits in decimal portion of the Traveling Salesman constant (A073008) form a prime number.