Sequences
392,541 sequences
- Primes which produce primes when the leading digit is moved to the end.A061461
Primes which produce primes when the leading digit is moved to the end.
- The exact power of 2 that divides the n-th Bell number (A000110). Has period 12.A061462
The exact power of 2 that divides the n-th Bell number (A000110). Has period 12.
- Numerator of 1 + 1/(2^2) + 1/(3^3) + ... 1/(n^n).A061463
Numerator of 1 + 1/(2^2) + 1/(3^3) + ... 1/(n^n).
- Denominator of 1/(1^1) + 1/(2^2) + 1/(3^3) + ... 1/(n^n).A061464
Denominator of 1/(1^1) + 1/(2^2) + 1/(3^3) + ... 1/(n^n).
- a(n) = floor(Sum_{k=1..n} sqrt(2k-1)).A061465
a(n) = floor(Sum_{k=1..n} sqrt(2k-1)).
- Product of primes prime(3*n+1), prime(3*n+2), prime(3*n+3).A061466
Product of primes prime(3*n+1), prime(3*n+2), prime(3*n+3).
- Remainder when the larger of n and its reverse is divided by the smaller.A061467
Remainder when the larger of n and its reverse is divided by the smaller.
- a(n) = d(n) + phi(n), where d(n) is the number of divisors (A000005) and phi(n) is Euler's totient function (A000010).A061468
a(n) = d(n) + phi(n), where d(n) is the number of divisors (A000005) and phi(n) is Euler's totient function (A000010).
- GCD of the amicable pairs: a(n) = gcd(A002025(n), A002046(n)).A061469
GCD of the amicable pairs: a(n) = gcd(A002025(n), A002046(n)).
- First (leftmost) digit - second digit + third digit - fourth digit .... = 1.A061470
First (leftmost) digit - second digit + third digit - fourth digit .... = 1.
- First (leftmost) digit - second digit + third digit - fourth digit .... = 2.A061471
First (leftmost) digit - second digit + third digit - fourth digit .... = 2.
- First (leftmost) digit - second digit + third digit - fourth digit .... = 3.A061472
First (leftmost) digit - second digit + third digit - fourth digit .... = 3.
- First (leftmost) digit - second digit + third digit - fourth digit .... = 4.A061473
First (leftmost) digit - second digit + third digit - fourth digit .... = 4.
- First (leftmost) digit - second digit + third digit - fourth digit .... = 5.A061474
First (leftmost) digit - second digit + third digit - fourth digit .... = 5.
- First (leftmost) digit - second digit + third digit - fourth digit .... = 6.A061475
First (leftmost) digit - second digit + third digit - fourth digit .... = 6.
- First (leftmost) digit - second digit + third digit - fourth digit .... = 7.A061476
First (leftmost) digit - second digit + third digit - fourth digit .... = 7.
- First (leftmost) digit - second digit + third digit - fourth digit .... = 8.A061477
First (leftmost) digit - second digit + third digit - fourth digit .... = 8.
- First (leftmost) digit - second digit + third digit - fourth digit .... = 9.A061478
First (leftmost) digit - second digit + third digit - fourth digit .... = 9.
- Smallest number m such that first digit - second digit + third digit - fourth digit ... (of m) = n.A061479
Smallest number m such that first digit - second digit + third digit - fourth digit ... (of m) = n.
- n-th digit in decimal expansion of 1/n.A061480
n-th digit in decimal expansion of 1/n.
- a(n) = floor(e^(n/e)).A061481
a(n) = floor(e^(n/e)).
- a(1) = 1, a(2) = 2, a(n) = sum of products of previous terms taking n-2 at a time.A061482
a(1) = 1, a(2) = 2, a(n) = sum of products of previous terms taking n-2 at a time.
- Numerator of 1 + 1/2 + 2/3 + 3/4 + ... + (n-1)/n.A061483
Numerator of 1 + 1/2 + 2/3 + 3/4 + ... + (n-1)/n.
- Numerator of 1/3 + 3/5 + 5/7 + ... + (2n - 1)/(2n + 1).A061484
Numerator of 1/3 + 3/5 + 5/7 + ... + (2n - 1)/(2n + 1).
- Numerator of 1/(2n-1) + 3/(2n-3) + 5/(2n-5) + ...(2n-1)/1.A061485
Numerator of 1/(2n-1) + 3/(2n-3) + 5/(2n-5) + ...(2n-1)/1.
- Let the number of digits in n be k; a(n) = sum of the products of the digits of n taken r at a time where r ranges from 1 to k.A061486
Let the number of digits in n be k; a(n) = sum of the products of the digits of n taken r at a time where r ranges from 1 to k.
- a(n) = sum of all the distinct numbers of all sizes formed by the digits of n.A061487
a(n) = sum of all the distinct numbers of all sizes formed by the digits of n.
- Factorize the Fibonacci numbers in order, skipping F(0)-F(2), F(6)=8 and F(12)=144; at each step at least one new prime will occur; append to the sequence the smallest such new prime.A061488
Factorize the Fibonacci numbers in order, skipping F(0)-F(2), F(6)=8 and F(12)=144; at each step at least one new prime will occur; append to the sequence the smallest such new prime.
- Numbers that are Fibonacci numbers plus or minus 1.A061489
Numbers that are Fibonacci numbers plus or minus 1.
- Smallest number which when iterated n times under A003285 gives a square.A061490
Smallest number which when iterated n times under A003285 gives a square.
- a(1) = 1, a(n) = least number such that the concatenation a(n)a(n-1)...a(1) is a cube.A061491
a(1) = 1, a(n) = least number such that the concatenation a(n)a(n-1)...a(1) is a cube.
- a(1) = 8, a(n) = least number such that the concatenation a(n)a(n-1)...a(1) is a cube.A061492
a(1) = 8, a(n) = least number such that the concatenation a(n)a(n-1)...a(1) is a cube.
- Roman numerals written using 1 for I, 2 for V, 3 for X, 4 for L, 5 for C, 6 for D, 7 for M.A061493
Roman numerals written using 1 for I, 2 for V, 3 for X, 4 for L, 5 for C, 6 for D, 7 for M.
- Relative class number h- of cyclotomic field Q(zeta_n) where n runs through positive integers not congruent to 2 (mod 4) [A042965, but omitting the initial 0].A061494
Relative class number h- of cyclotomic field Q(zeta_n) where n runs through positive integers not congruent to 2 (mod 4) [A042965, but omitting the initial 0].
- a(n) = lcm(3n+1, 3n+2, 3n+3).A061495
a(n) = lcm(3n+1, 3n+2, 3n+3).
- a(n) = gcd(abundant(n), abundant(n+1)) where abundant(n) is the n-th abundant number.A061496
a(n) = gcd(abundant(n), abundant(n+1)) where abundant(n) is the n-th abundant number.
- Product of all distinct nonzero numbers that can be formed from the digits of n.A061497
Product of all distinct nonzero numbers that can be formed from the digits of n.
- Number of distinct terms in the first difference sequence of reduced residue system[=dRRS] for n.A061498
Number of distinct terms in the first difference sequence of reduced residue system[=dRRS] for n.
- Integer part of geometric mean of the distinct nonzero numbers that can be formed from the digits of n.A061499
Integer part of geometric mean of the distinct nonzero numbers that can be formed from the digits of n.
- Integer part of arithmetic mean of distinct nonzero numbers that can be formed from the digits of n.A061500
Integer part of arithmetic mean of distinct nonzero numbers that can be formed from the digits of n.
- a(1) = 1, a(n+1) = (a(n) + n) mod 10.A061501
a(1) = 1, a(n+1) = (a(n) + n) mod 10.
- a(n) = Sum_{k<=n} tau(k)^2, where tau = number of divisors function A000005.A061502
a(n) = Sum_{k<=n} tau(k)^2, where tau = number of divisors function A000005.
- a(n) = Sum_{k=1..n} tau(k^2), where tau is the number of divisors function A000005.A061503
a(n) = Sum_{k=1..n} tau(k^2), where tau is the number of divisors function A000005.
- a(1) = 1; for n>1, a(n) = numbers of letters in French name for a(n-1).A061504
a(1) = 1; for n>1, a(n) = numbers of letters in French name for a(n-1).
- Leading digit of n^n.A061505
Leading digit of n^n.
- a(n) = lcm(6n+2, 6n+4, 6n+6).A061506
a(n) = lcm(6n+2, 6n+4, 6n+6).
- Numbers with all odd digits, in which each digit divides the number formed by the rest, i.e., the number obtained by just removing this digit.A061507
Numbers with all odd digits, in which each digit divides the number formed by the rest, i.e., the number obtained by just removing this digit.
- Smallest positive m such that n^m has at least n digits.A061508
Smallest positive m such that n^m has at least n digits.
- Write n in decimal, omit 0's, replace the k-th digit d[k] with the k-th prime, raised to d[k]-th power and multiply.A061509
Write n in decimal, omit 0's, replace the k-th digit d[k] with the k-th prime, raised to d[k]-th power and multiply.
- Write n in decimal, omit 0's, raise each digit k to k-th power and multiply.A061510
Write n in decimal, omit 0's, raise each digit k to k-th power and multiply.