Sequences
392,541 sequences
- Path of a knight's tour on an infinite chessboard.A068611
Path of a knight's tour on an infinite chessboard.
- Path of a knight's tour on an infinite chessboard.A068612
Path of a knight's tour on an infinite chessboard.
- Path of a knight's tour on an infinite chessboard.A068613
Path of a knight's tour on an infinite chessboard.
- Path of a knight's tour on an infinite chessboard.A068614
Path of a knight's tour on an infinite chessboard.
- Path of a knight's tour on an infinite chessboard.A068615
Path of a knight's tour on an infinite chessboard.
- Starting from a(1)=7, each subsequent term is the minimal square obtained by inserting at least one digit into the previous term.A068616
Starting from a(1)=7, each subsequent term is the minimal square obtained by inserting at least one digit into the previous term.
- Starting from a(1)=8, each subsequent term is the minimal square obtained by inserting at least one digit in the previous term.A068617
Starting from a(1)=8, each subsequent term is the minimal square obtained by inserting at least one digit in the previous term.
- a(1) = 1; a(n+1) = smallest triangular number > a(n) formed by adding at least one digit to a(n).A068618
a(1) = 1; a(n+1) = smallest triangular number > a(n) formed by adding at least one digit to a(n).
- a(1) = 3; a(n+1) = smallest triangular number formed by inserting one or more digits into a(n).A068619
a(1) = 3; a(n+1) = smallest triangular number formed by inserting one or more digits into a(n).
- Number of strings over Z_4 of length n with trace 0 and subtrace 0.A068620
Number of strings over Z_4 of length n with trace 0 and subtrace 0.
- a(1) = 7; a(n+1) = smallest triangular number > a(n) formed by adding at least one digit to a(n).A068621
a(1) = 7; a(n+1) = smallest triangular number > a(n) formed by adding at least one digit to a(n).
- a(1) = 5; a(n+1) = smallest triangular number > a(n) formed by adding at least one digit to a(n).A068622
a(1) = 5; a(n+1) = smallest triangular number > a(n) formed by adding at least one digit to a(n).
- a(1) = 8; a(n+1) = smallest triangular number > a(n) formed by adding at least one digit to a(n).A068623
a(1) = 8; a(n+1) = smallest triangular number > a(n) formed by adding at least one digit to a(n).
- a(1) = 9; a(n+1) = smallest triangular number > a(n) formed by adding at least one digit to a(n).A068624
a(1) = 9; a(n+1) = smallest triangular number > a(n) formed by adding at least one digit to a(n).
- Reduced root factorial of n: product of the smallest integer root of numbers from 1 to n.A068625
Reduced root factorial of n: product of the smallest integer root of numbers from 1 to n.
- a(3n) = a(3n-1) = 3*n^2, a(3n-2) = 3*n^2 - 3*n + 1.A068626
a(3n) = a(3n-1) = 3*n^2, a(3n-2) = 3*n^2 - 3*n + 1.
- a(0) = 0, a(n) = a(n-1) + n if n does not divide a(n-1). a(n) = a(n-1) - n if n divides a(n-1). a(n) = n if a(n-1) = 0.A068627
a(0) = 0, a(n) = a(n-1) + n if n does not divide a(n-1). a(n) = a(n-1) - n if n divides a(n-1). a(n) = n if a(n-1) = 0.
- Numbers occurring twice in A068627.A068628
Numbers occurring twice in A068627.
- a(1) = 1. a(n) = n*a(n-1) if gcd(n,a(n-1)) = 1, a(n-1)/n if n divides a(n-1), otherwise a(n) = a(n-1).A068629
a(1) = 1. a(n) = n*a(n-1) if gcd(n,a(n-1)) = 1, a(n-1)/n if n divides a(n-1), otherwise a(n) = a(n-1).
- a(0)=0; a(n) = n + a(n-1) if gcd(n,a(n-1)) = 1 or a(n-1) = 0; a(n) = a(n-1) - n if n divides a(n-1), otherwise a(n) = a(n-1).A068630
a(0)=0; a(n) = n + a(n-1) if gcd(n,a(n-1)) = 1 or a(n-1) = 0; a(n) = a(n-1) - n if n divides a(n-1), otherwise a(n) = a(n-1).
- a(1) = 4; a(n) = smallest composite number different from the previous ones such that the sum of all the terms is a composite number.A068631
a(1) = 4; a(n) = smallest composite number different from the previous ones such that the sum of all the terms is a composite number.
- a(1) = 2; a(n+1) = smallest composite number not in the sequence such that the sum of all the terms is prime.A068632
a(1) = 2; a(n+1) = smallest composite number not in the sequence such that the sum of all the terms is prime.
- a(1) = 11 by convention; for n > 1, if n = p^a*q^b... then a(n) = concatenate(p,a,q,b,...).A068633
a(1) = 11 by convention; for n > 1, if n = p^a*q^b... then a(n) = concatenate(p,a,q,b,...).
- a(n) = lcm(n, R(n)), where R(n) (A004086) = digit reversal of n.A068634
a(n) = lcm(n, R(n)), where R(n) (A004086) = digit reversal of n.
- Smaller of the first twin pair to yield a twin pair chain of length n.A068635
Smaller of the first twin pair to yield a twin pair chain of length n.
- a(n) = Min(n, R(n)), where R(n) (A004086) = digit reversal of n.A068636
a(n) = Min(n, R(n)), where R(n) (A004086) = digit reversal of n.
- a(n) = Max(n, R(n)), where R(n) (A004086) = digit reversal of n.A068637
a(n) = Max(n, R(n)), where R(n) (A004086) = digit reversal of n.
- a(1) = 1, a(n) = smallest distinct composite number such that a(n) + a(k) is a composite number for all k = 1 to n.A068638
a(1) = 1, a(n) = smallest distinct composite number such that a(n) + a(k) is a composite number for all k = 1 to n.
- a(0) = 0, a(n) = a(n-1) + (-1)^p(n) for n >= 1, where p(n) = highest power of 2 dividing n.A068639
a(0) = 0, a(n) = a(n-1) + (-1)^p(n) for n >= 1, where p(n) = highest power of 2 dividing n.
- Define f(n) = 2n+1, a(n) = largest prime of the form f(f(f(...(n))). If no such prime exists then a(n) = 0.A068640
Define f(n) = 2n+1, a(n) = largest prime of the form f(f(f(...(n))). If no such prime exists then a(n) = 0.
- Smallest n-digit palindromic triangular number, or 0 if no such number exists.A068641
Smallest n-digit palindromic triangular number, or 0 if no such number exists.
- Index of the smallest n-digit palindromic triangular number, or 0 if no such number exists.A068642
Index of the smallest n-digit palindromic triangular number, or 0 if no such number exists.
- Largest n-digit palindromic triangular number, or 0 if no such number exists.A068643
Largest n-digit palindromic triangular number, or 0 if no such number exists.
- Index of the largest n-digit palindromic triangular number, or 0 if no such number exists.A068644
Index of the largest n-digit palindromic triangular number, or 0 if no such number exists.
- Primes in which a string of 3's is sandwiched between two 1's.A068645
Primes in which a string of 3's is sandwiched between two 1's.
- Primes in which a string of 5's is sandwiched between two 1's.A068646
Primes in which a string of 5's is sandwiched between two 1's.
- Primes in which a string of 6's is sandwiched between two 1's.A068647
Primes in which a string of 6's is sandwiched between two 1's.
- Primes in which a string of 8's is sandwiched between two 1's.A068648
Primes in which a string of 8's is sandwiched between two 1's.
- Primes in which a string of 9's is sandwiched between two 1's.A068649
Primes in which a string of 9's is sandwiched between two 1's.
- Primes in which a string of 1's is sandwiched between two 3's.A068650
Primes in which a string of 1's is sandwiched between two 3's.
- Primes in which a string of 2's is sandwiched between two 9's.A068651
Primes in which a string of 2's is sandwiched between two 9's.
- Numbers such that every cyclic permutation is a prime.A068652
Numbers such that every cyclic permutation is a prime.
- Composite numbers such that every cyclic shift (other than the number itself) gives a prime.A068653
Composite numbers such that every cyclic shift (other than the number itself) gives a prime.
- Prime numbers such that every cyclic permutation (other than the number itself) is composite.A068654
Prime numbers such that every cyclic permutation (other than the number itself) is composite.
- Primes which are a concatenation of at least two consecutive primes.A068655
Primes which are a concatenation of at least two consecutive primes.
- Duplicate of A030997.A068656
Duplicate of A030997.
- Successive left concatenation of floor(k/2) beginning with n until we reach 1.A068657
Successive left concatenation of floor(k/2) beginning with n until we reach 1.
- Primes in A068657.A068658
Primes in A068657.
- Primes formed from the concatenation of n, n-1 and n for some n > 0.A068659
Primes formed from the concatenation of n, n-1 and n for some n > 0.
- Primes formed from the concatenation of k, k+1 and k for some k.A068660
Primes formed from the concatenation of k, k+1 and k for some k.