Sequences
392,541 sequences
- List of solutions to the Znám problem sorted first by length, then lexicographically.A075461
List of solutions to the Znám problem sorted first by length, then lexicographically.
- a(n) is the number of solutions to the all-ones lights out problem on an n X n square.A075462
a(n) is the number of solutions to the all-ones lights out problem on an n X n square.
- a(n) is the number of rotation-reflection inequivalent solutions to the all-ones lights out problem on an n X n square.A075463
a(n) is the number of rotation-reflection inequivalent solutions to the all-ones lights out problem on an n X n square.
- a(n) is the minimal number of nontrivial switch flippings needed to solve the all-ones lights out problem on an n X n square.A075464
a(n) is the minimal number of nontrivial switch flippings needed to solve the all-ones lights out problem on an n X n square.
- Rounded average of first n primes.A075465
Rounded average of first n primes.
- Trajectory of 266718 under the Reverse and Add! operation carried out in base 4, written in base 10.A075466
Trajectory of 266718 under the Reverse and Add! operation carried out in base 4, written in base 10.
- Trajectory of 270798 under the Reverse and Add! operation carried out in base 4, written in base 10.A075467
Trajectory of 270798 under the Reverse and Add! operation carried out in base 4, written in base 10.
- Minimal m such that n^n-m and n^n+m are both primes, or -1 if there is no such m.A075468
Minimal m such that n^n-m and n^n+m are both primes, or -1 if there is no such m.
- Maximal m such that n^n-m and n^n+m are both primes, or -1 if there is no such m.A075469
Maximal m such that n^n-m and n^n+m are both primes, or -1 if there is no such m.
- Primes arising from the rearrangement of the natural numbers such that sum of n (n>1) terms starting from the n-th term (included) is a prime (A073672).A075470
Primes arising from the rearrangement of the natural numbers such that sum of n (n>1) terms starting from the n-th term (included) is a prime (A073672).
- Rounded root-mean-square (RMS) value of first n primes.A075471
Rounded root-mean-square (RMS) value of first n primes.
- Rounded root-mean-square (RMS) value of first n perfect powers.A075472
Rounded root-mean-square (RMS) value of first n perfect powers.
- n^n + n! - 2*(n+1)^(n-1).A075473
n^n + n! - 2*(n+1)^(n-1).
- Duplicate of A069225.A075474
Duplicate of A069225.
- Numbers n such that reverse(phi(n+1)) = phi(n).A075475
Numbers n such that reverse(phi(n+1)) = phi(n).
- Number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated, starting with numbers of form 64n+7. Corresponds to selection of every 16th term from A074474.A075476
Number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated, starting with numbers of form 64n+7. Corresponds to selection of every 16th term from A074474.
- Number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated, starting with numbers of form 64n+15. Corresponds to selection of every 16th term from A074474.A075477
Number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated, starting with numbers of form 64n+15. Corresponds to selection of every 16th term from A074474.
- Number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated, starting with numbers of form 64n+27. Corresponds to selection of every 16th term from A074474.A075478
Number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated, starting with numbers of form 64n+27. Corresponds to selection of every 16th term from A074474.
- Number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated, starting with numbers of form 64n+31. Corresponds to selection of every 16th term from A074474.A075479
Number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated, starting with numbers of form 64n+31. Corresponds to selection of every 16th term from A074474.
- Number of iteration that first becomes smaller than the initial value if Collatz function (A006370) is iterated, starting with numbers of the form 64n + 39.A075480
Number of iteration that first becomes smaller than the initial value if Collatz function (A006370) is iterated, starting with numbers of the form 64n + 39.
- Number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated, starting with numbers of form 64n+47. Corresponds to selection of every 16th term from A074474.A075481
Number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated, starting with numbers of form 64n+47. Corresponds to selection of every 16th term from A074474.
- Number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated, starting with numbers of the form 64n + 59.A075482
Number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated, starting with numbers of the form 64n + 59.
- Number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated, starting with numbers of form 64n+63.A075483
Number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated, starting with numbers of form 64n+63.
- Length of iteration-list when Collatz-function(A006370) is iterated with initial value 5^n.A075484
Length of iteration-list when Collatz-function(A006370) is iterated with initial value 5^n.
- Length of iteration list when Collatz-function is iterated with initial value 2^n - 1.A075485
Length of iteration list when Collatz-function is iterated with initial value 2^n - 1.
- Length of iteration list when Collatz-function is iterated with initial value 2^n + 1.A075486
Length of iteration list when Collatz-function is iterated with initial value 2^n + 1.
- Length of iteration list when Collatz-function is iterated with initial value 1+3^n.A075487
Length of iteration list when Collatz-function is iterated with initial value 1+3^n.
- Length of iteration list when Collatz-function is iterated with initial value -1+3^n.A075488
Length of iteration list when Collatz-function is iterated with initial value -1+3^n.
- a(n) = prime((n+1)!) - prime(n!).A075489
a(n) = prime((n+1)!) - prime(n!).
- a(n) = Sum_{j=1..n} phi(n)^j.A075490
a(n) = Sum_{j=1..n} phi(n)^j.
- Sum of digits of n minus number of divisors of n.A075491
Sum of digits of n minus number of divisors of n.
- Sum of digits of n < number of divisors of n.A075492
Sum of digits of n < number of divisors of n.
- Numbers k such that (sum of digits of k) > (number of divisors of k).A075493
Numbers k such that (sum of digits of k) > (number of divisors of k).
- Squares whose sum of digits exceeds the number of divisors.A075494
Squares whose sum of digits exceeds the number of divisors.
- Convolution of A075298 with A056594.A075495
Convolution of A075298 with A056594.
- a(1)=1, a(n) = Sum_{k=1..n-1} max(a(k), a(n-k)).A075496
a(1)=1, a(n) = Sum_{k=1..n-1} max(a(k), a(n-k)).
- Stirling2 triangle with scaled diagonals (powers of 2).A075497
Stirling2 triangle with scaled diagonals (powers of 2).
- Stirling2 triangle with scaled diagonals (powers of 3).A075498
Stirling2 triangle with scaled diagonals (powers of 3).
- Stirling2 triangle with scaled diagonals (powers of 4).A075499
Stirling2 triangle with scaled diagonals (powers of 4).
- Stirling2 triangle with scaled diagonals (powers of 5).A075500
Stirling2 triangle with scaled diagonals (powers of 5).
- Stirling2 triangle with scaled diagonals (powers of 6).A075501
Stirling2 triangle with scaled diagonals (powers of 6).
- Triangle read by rows: Stirling2 triangle with scaled diagonals (powers of 7).A075502
Triangle read by rows: Stirling2 triangle with scaled diagonals (powers of 7).
- Stirling2 triangle with scaled diagonals (powers of 8).A075503
Stirling2 triangle with scaled diagonals (powers of 8).
- Stirling2 triangle with scaled diagonals (powers of 9).A075504
Stirling2 triangle with scaled diagonals (powers of 9).
- Stirling2 triangle with scaled diagonals (powers of 10).A075505
Stirling2 triangle with scaled diagonals (powers of 10).
- Shifts one place left under 7th-order binomial transform.A075506
Shifts one place left under 7th-order binomial transform.
- Shifts one place left under 8th-order binomial transform.A075507
Shifts one place left under 8th-order binomial transform.
- Shifts one place left under 9th-order binomial transform.A075508
Shifts one place left under 9th-order binomial transform.
- Shifts one place left under 10th-order binomial transform.A075509
Shifts one place left under 10th-order binomial transform.
- Fifth column of triangle A075497.A075510
Fifth column of triangle A075497.