Sequences
392,541 sequences
- f-amicable numbers where f(n) = n-1.A066511
f-amicable numbers where f(n) = n-1.
- Least nonnegative integer not the sum or product of any previous pair. a(1)=0.A066512
Least nonnegative integer not the sum or product of any previous pair. a(1)=0.
- Numbers n such that f(n) = f(n-1) - f(n-2) where f is the prime gap function given by f(m) = prime(m+1) - prime(m) and prime(m) denotes the m-th prime.A066513
Numbers n such that f(n) = f(n-1) - f(n-2) where f is the prime gap function given by f(m) = prime(m+1) - prime(m) and prime(m) denotes the m-th prime.
- Number of subgroups of the group GL(2,Z_n) of invertible 2 X 2 matrices mod n (sequence A000252).A066514
Number of subgroups of the group GL(2,Z_n) of invertible 2 X 2 matrices mod n (sequence A000252).
- Numbers n such that prime(n+1) + prime(n-2) = 2*prime(n-1), where prime(m) is the m-th prime.A066515
Numbers n such that prime(n+1) + prime(n-2) = 2*prime(n-1), where prime(m) is the m-th prime.
- Numbers n such that g(sigma(n)) = phi(n), where g(n) = prime(n+1) - prime(n).A066516
Numbers n such that g(sigma(n)) = phi(n), where g(n) = prime(n+1) - prime(n).
- Continued fraction expansion of Artin constant of rank 2: product(1-1/(p^3-p^2), p=prime).A066517
Continued fraction expansion of Artin constant of rank 2: product(1-1/(p^3-p^2), p=prime).
- Anti-divisor class sums of n.A066518
Anti-divisor class sums of n.
- Gaps between successive numbers with an anti-divisor class sum of zero.A066519
Gaps between successive numbers with an anti-divisor class sum of zero.
- Number of primes of the form 4m+3 <= n minus number of primes of the form 4m+1 <= n.A066520
Number of primes of the form 4m+3 <= n minus number of primes of the form 4m+1 <= n.
- Primes p(k) such that the product of digits of p(k) equals the product of digits of k.A066521
Primes p(k) such that the product of digits of p(k) equals the product of digits of k.
- Numbers n whose divisors less than or equal to sqrt(n) are consecutive, from 1 up to some number k.A066522
Numbers n whose divisors less than or equal to sqrt(n) are consecutive, from 1 up to some number k.
- Crowded numbers: for any k in the sequence, d(k)/k is larger than d(m)/m for all m > k.A066523
Crowded numbers: for any k in the sequence, d(k)/k is larger than d(m)/m for all m > k.
- a(n) = n*(2^n - 1).A066524
a(n) = n*(2^n - 1).
- Primes of form Sum_{k=1..n} prime(k)^3.A066525
Primes of form Sum_{k=1..n} prime(k)^3.
- a(n) = binomial(Fibonacci(n), Fibonacci(n-1)).A066526
a(n) = binomial(Fibonacci(n), Fibonacci(n-1)).
- Triangular numbers that for some k are also the sum of the first k primes.A066527
Triangular numbers that for some k are also the sum of the first k primes.
- Non-palindromic triangular numbers whose reverse is a triangular number with the same number of digits.A066528
Non-palindromic triangular numbers whose reverse is a triangular number with the same number of digits.
- a(n) is the least index such that the least primitive root of the a(n)-th prime is n, or zero if no such prime exists.A066529
a(n) is the least index such that the least primitive root of the a(n)-th prime is n, or zero if no such prime exists.
- Expansion of (1+x+x^3)/((1-x)*(1-x^4)).A066530
Expansion of (1+x+x^3)/((1-x)*(1-x^4)).
- Numbers which can be expressed as the product of a number and its reversal in at least two different ways.A066531
Numbers which can be expressed as the product of a number and its reversal in at least two different ways.
- If n is odd a(n) = 1, if n is even a(n) = 2^(n-1).A066532
If n is odd a(n) = 1, if n is even a(n) = 2^(n-1).
- Erroneous version of A058986.A066533
Erroneous version of A058986.
- Total number of walks with length > 0 in the Hasse diagram of a Boolean algebra of order n.A066534
Total number of walks with length > 0 in the Hasse diagram of a Boolean algebra of order n.
- Number of ways of writing n as a sum of n squares.A066535
Number of ways of writing n as a sum of n squares.
- Number of ways of writing n as a sum of n+1 squares.A066536
Number of ways of writing n as a sum of n+1 squares.
- Number of planar graphs on n labeled nodes.A066537
Number of planar graphs on n labeled nodes.
- Sum of the digits of the n-th Mersenne prime (A000668).A066538
Sum of the digits of the n-th Mersenne prime (A000668).
- Difference between larger and smaller terms of n-th amicable pair.A066539
Difference between larger and smaller terms of n-th amicable pair.
- The first of two consecutive primes with equal digital sums.A066540
The first of two consecutive primes with equal digital sums.
- Number of normal subgroups of the group GL(2,Z_n) of invertible 2 X 2 matrices mod n (sequence A000252).A066541
Number of normal subgroups of the group GL(2,Z_n) of invertible 2 X 2 matrices mod n (sequence A000252).
- Nonnegative integers all of whose anti-divisors are either 2 or odd.A066542
Nonnegative integers all of whose anti-divisors are either 2 or odd.
- Number of spanning trees in the line graph of the product of two cycle graphs, each of order n, L(C_n x C_n).A066543
Number of spanning trees in the line graph of the product of two cycle graphs, each of order n, L(C_n x C_n).
- Number of spanning trees in the line graph of the product of two star graphs, each of order n, L(S_n x S_n).A066544
Number of spanning trees in the line graph of the product of two star graphs, each of order n, L(S_n x S_n).
- Number of spanning trees in the line graph of the product of two complete graph, each of order n, L(K_n x K_n).A066545
Number of spanning trees in the line graph of the product of two complete graph, each of order n, L(K_n x K_n).
- Number of spanning trees in the line graph of the box product of two (2 x n) grid graphs.A066546
Number of spanning trees in the line graph of the box product of two (2 x n) grid graphs.
- Let N = 123456789101112131415161718..., the concatenation of the natural numbers. a(n) is the n-digit number formed from the digits of N starting from the {n(n-1)/2 +1}th digit. Omit any leading zeros.A066547
Let N = 123456789101112131415161718..., the concatenation of the natural numbers. a(n) is the n-digit number formed from the digits of N starting from the {n(n-1)/2 +1}th digit. Omit any leading zeros.
- Sum of digits of n-th term of A066547.A066548
Sum of digits of n-th term of A066547.
- Let N = 235711171923293137..., the concatenation of the primes. a(n) is the n-digit number formed from the digits of N starting from the {n(n-1)/2 +1}th digit. Omit any leading zeros.A066549
Let N = 235711171923293137..., the concatenation of the primes. a(n) is the n-digit number formed from the digits of N starting from the {n(n-1)/2 +1}th digit. Omit any leading zeros.
- Sum of digits of n-th term of A066549.A066550
Sum of digits of n-th term of A066549.
- Let N =149162536496481100121441691962252562893243614..., the concatenation of the squares. a(n) is the n-digit number formed from the digits of N starting from the {n(n-1)/2 +1}th digit. Omit any leading zeros.A066551
Let N =149162536496481100121441691962252562893243614..., the concatenation of the squares. a(n) is the n-digit number formed from the digits of N starting from the {n(n-1)/2 +1}th digit. Omit any leading zeros.
- Sum of digits of n-th term of A066551.A066552
Sum of digits of n-th term of A066551.
- Let N = 1357911131517192123252729313335373941434547495153555759616365676971..., the concatenation of the odd numbers. a(n) is the n-digit number formed from the digits of N starting from the {n(n-1)/2 +1}th digit. Omit any leading zeros.A066553
Let N = 1357911131517192123252729313335373941434547495153555759616365676971..., the concatenation of the odd numbers. a(n) is the n-digit number formed from the digits of N starting from the {n(n-1)/2 +1}th digit. Omit any leading zeros.
- Sum of digits of n-th term of A066553.A066554
Sum of digits of n-th term of A066553.
- a(n) = next substring in concatenation of even numbers with length n (incl. leading zeros).A066555
a(n) = next substring in concatenation of even numbers with length n (incl. leading zeros).
- Sum of digits of n-th term of A066555.A066556
Sum of digits of n-th term of A066555.
- Largest n-digit multiple of n.A066557
Largest n-digit multiple of n.
- a(n) = A066557(n)/n.A066558
a(n) = A066557(n)/n.
- a(n) = ceiling(10^(n-1)/n).A066559
a(n) = ceiling(10^(n-1)/n).
- Smallest composite number divisible by n.A066560
Smallest composite number divisible by n.