Sequences
392,541 sequences
- Squares of A002276.A075411
Squares of A002276.
- Squares of A002277.A075412
Squares of A002277.
- Squares of A002278.A075413
Squares of A002278.
- Squares of A002279: a(n) = (5*(10^n - 1)/9)^2.A075414
Squares of A002279: a(n) = (5*(10^n - 1)/9)^2.
- Squares of A002280 or numbers (666...6)^2.A075415
Squares of A002280 or numbers (666...6)^2.
- Squares of A002281.A075416
Squares of A002281.
- Squares of A002282: a(n) = (8*(10^n - 1)/9)^2.A075417
Squares of A002282: a(n) = (8*(10^n - 1)/9)^2.
- Sum of generalized tribonacci numbers A001644 and inverted tribonacci numbers A075298.A075418
Sum of generalized tribonacci numbers A001644 and inverted tribonacci numbers A075298.
- Convolution of A073145 with A056594.A075419
Convolution of A073145 with A056594.
- Trajectory of n under the Reverse and Add! operation carried out in base 4 (presumably) does not reach a palindrome.A075420
Trajectory of n under the Reverse and Add! operation carried out in base 4 (presumably) does not reach a palindrome.
- Trajectory of n under the Reverse and Add! operation carried out in base 4 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.A075421
Trajectory of n under the Reverse and Add! operation carried out in base 4 (presumably) does not reach a palindrome and (presumably) does not join the trajectory of any term m < n.
- Primitive numbers n such that the product of factorials of all proper divisors of n does not divide n!.A075422
Primitive numbers n such that the product of factorials of all proper divisors of n does not divide n!.
- a(n) = rad(n) - 1, where rad(n) is the squarefree kernel of n (A007947).A075423
a(n) = rad(n) - 1, where rad(n) is the squarefree kernel of n (A007947).
- a(n) = A075423(A075423(n)).A075424
a(n) = A075423(A075423(n)).
- Number of steps to reach 1 starting with n and iterating the map n ->rad(n)-1, where rad(n) is the squarefree kernel of n (A007947).A075425
Number of steps to reach 1 starting with n and iterating the map n ->rad(n)-1, where rad(n) is the squarefree kernel of n (A007947).
- Smallest initial value k that reaches 1 in n steps when iterating the map m -> rad(m)-1, where rad(m) is the squarefree kernel of m (A007947).A075426
Smallest initial value k that reaches 1 in n steps when iterating the map m -> rad(m)-1, where rad(m) is the squarefree kernel of m (A007947).
- a(0) = 1; a(n) = a(n-1)+1 if n is even, otherwise a(n) = 2*a(n-1).A075427
a(0) = 1; a(n) = a(n-1)+1 if n is even, otherwise a(n) = 2*a(n-1).
- Number of steps to reach the first integer (= A075429(n)) starting with 1 + 2/(n*(n+1)) and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.A075428
Number of steps to reach the first integer (= A075429(n)) starting with 1 + 2/(n*(n+1)) and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.
- First integer reached when starting with 1+2/(n*(n+1)) and iterating the map x -> x*ceiling(x) A075428(n) times, or -1 if no integer is ever reached.A075429
First integer reached when starting with 1+2/(n*(n+1)) and iterating the map x -> x*ceiling(x) A075428(n) times, or -1 if no integer is ever reached.
- Primes with a squarefree neighbor.A075430
Primes with a squarefree neighbor.
- Primes of the form n+mu(n), where mu is the Moebius function (A008683).A075431
Primes of the form n+mu(n), where mu is the Moebius function (A008683).
- Primes with no squarefree neighbors.A075432
Primes with no squarefree neighbors.
- Perfect powers pp(n) with perfect power index n.A075433
Perfect powers pp(n) with perfect power index n.
- Numbers that are not the sum of two perfect powers.A075434
Numbers that are not the sum of two perfect powers.
- T(n,k) = right- or upward-moving paths connecting opposite corners of an n X n chessboard, visiting the diagonal at k points between start and finish.A075435
T(n,k) = right- or upward-moving paths connecting opposite corners of an n X n chessboard, visiting the diagonal at k points between start and finish.
- Right- or upward-moving paths connecting opposite corners of an n X n chessboard, visiting the diagonal in 0 up to (n-2) intermediate points between start and finish. Equivalently, subdivide the chessboard into 1 up to (n-1) blocks along the diagonal in all possible ways and sum the path-count over all sub-blocks.A075436
Right- or upward-moving paths connecting opposite corners of an n X n chessboard, visiting the diagonal in 0 up to (n-2) intermediate points between start and finish. Equivalently, subdivide the chessboard into 1 up to (n-1) blocks along the diagonal in all possible ways and sum the path-count over all sub-blocks.
- Triangle read by rows giving successive iterations of the Rule 110 elementary cellular automaton starting with a single black (1) cell where row n is of length 2n+1.A075437
Triangle read by rows giving successive iterations of the Rule 110 elementary cellular automaton starting with a single black (1) cell where row n is of length 2n+1.
- Triangle read by rows giving successive iterations of the Rule 60 elementary cellular automaton starting with a single ON cell where row n is of length 2n+1.A075438
Triangle read by rows giving successive iterations of the Rule 60 elementary cellular automaton starting with a single ON cell where row n is of length 2n+1.
- Triangle read by rows giving successive iterations of the Rule 102 elementary cellular automaton starting with a single ON cell where row n is of length 2n+1.A075439
Triangle read by rows giving successive iterations of the Rule 102 elementary cellular automaton starting with a single ON cell where row n is of length 2n+1.
- Numerator of 1/pp(n) - 1/pp(n+1), where pp(n) = n-th prime power.A075440
Numerator of 1/pp(n) - 1/pp(n+1), where pp(n) = n-th prime power.
- a(n) is the number of solutions to the n-term Znám problem.A075441
a(n) is the number of solutions to the n-term Znám problem.
- Slowest-growing sequence of primes whose reciprocals sum to 1.A075442
Slowest-growing sequence of primes whose reciprocals sum to 1.
- a(n)=(1/2)Sum_h |h-h'| with h and h' in [1,n], gcd(h,n)=1, hh'=1 (mod n).A075443
a(n)=(1/2)Sum_h |h-h'| with h and h' in [1,n], gcd(h,n)=1, hh'=1 (mod n).
- a(n) = A075443(n) mod A000010(n) [using least nonnegative residue].A075444
a(n) = A075443(n) mod A000010(n) [using least nonnegative residue].
- a(n) = gcd(A075443(n), A000010(n)).A075445
a(n) = gcd(A075443(n), A000010(n)).
- Numerator of A075443(n)/A000010(n).A075446
Numerator of A075443(n)/A000010(n).
- Denominator of A075443(n)/A000010(n).A075447
Denominator of A075443(n)/A000010(n).
- A075443(n^2)-A075443(n) mod n [i.e., least nonnegative residue].A075448
A075443(n^2)-A075443(n) mod n [i.e., least nonnegative residue].
- Numbers k such that A075443(k) == 0 (mod A000010(k)).A075449
Numbers k such that A075443(k) == 0 (mod A000010(k)).
- a(n)=A075443(A075449(n)).A075450
a(n)=A075443(A075449(n)).
- Numbers k such that gcd(A075443(k), A000010(k)) = 1.A075451
Numbers k such that gcd(A075443(k), A000010(k)) = 1.
- a(n) = A075443(A075451(n)).A075452
a(n) = A075443(A075451(n)).
- Numerator of 1/pp(n) + 1/pp(n+1), where pp(n) = A001597(n-1) is the n-th perfect power.A075453
Numerator of 1/pp(n) + 1/pp(n+1), where pp(n) = A001597(n-1) is the n-th perfect power.
- Integer averages of two successive perfect powers (pp(n) + pp(n+1))/2.A075454
Integer averages of two successive perfect powers (pp(n) + pp(n+1))/2.
- Prime averages of two successive perfect powers (A001597(k) + A001597(k+1))/2.A075455
Prime averages of two successive perfect powers (A001597(k) + A001597(k+1))/2.
- Distinct-digit averages of two successive perfect powers (pp(n) + pp(n+1))/2.A075456
Distinct-digit averages of two successive perfect powers (pp(n) + pp(n+1))/2.
- Integer averages of first n perfect powers for some n.A075457
Integer averages of first n perfect powers for some n.
- Domination number for queens' graph Q(n).A075458
Domination number for queens' graph Q(n).
- Duplicate of A050248.A075459
Duplicate of A050248.
- Odd primitive numbers such that n! divided by product of factorials of all proper divisors of n is not an integer.A075460
Odd primitive numbers such that n! divided by product of factorials of all proper divisors of n is not an integer.