Sequences
392,541 sequences
- Order of group of n X n X n Rubik cube, under assumptions s, not-m, not-i.A080661
Order of group of n X n X n Rubik cube, under assumptions s, not-m, not-i.
- Order of group of n X n X n Rubik cube, under assumptions s, not-m, i.A080662
Order of group of n X n X n Rubik cube, under assumptions s, not-m, i.
- a(n) = 3*n^2 - 1.A080663
a(n) = 3*n^2 - 1.
- Numbers n such that n-th Catalan number is squarefree.A080664
Numbers n such that n-th Catalan number is squarefree.
- Squares that are the sum of 3 consecutive primes.A080665
Squares that are the sum of 3 consecutive primes.
- Numbers k such that k^2 + 1 and k^2 - 1 are not squarefree.A080666
Numbers k such that k^2 + 1 and k^2 - 1 are not squarefree.
- a(1)=3; for n>1, a(n)=a(n-1)+4 if n is already in the sequence, a(n)=a(n-1)+3 otherwise.A080667
a(1)=3; for n>1, a(n)=a(n-1)+4 if n is already in the sequence, a(n)=a(n-1)+3 otherwise.
- Numbers of the form n!+n^3.A080668
Numbers of the form n!+n^3.
- a(1) = 1; a(2) = 2; a(n) = Fibonacci(a(n-1) + a(n-2)) if n > 2.A080669
a(1) = 1; a(2) = 2; a(n) = Fibonacci(a(n-1) + a(n-2)) if n > 2.
- Literal reading of the prime factorization of n.A080670
Literal reading of the prime factorization of n.
- Numbers having divisors 2 or 3 or 5.A080671
Numbers having divisors 2 or 3 or 5.
- Numbers having divisors 2 or 3 or 5 or 7.A080672
Numbers having divisors 2 or 3 or 5 or 7.
- Largest number with exactly n representations as sum of five positive squares (or 0 if no number with exactly n representations exists).A080673
Largest number with exactly n representations as sum of five positive squares (or 0 if no number with exactly n representations exists).
- a(n) = (4/3)*(4^n - 1).A080674
a(n) = (4/3)*(4^n - 1).
- a(n) = (5*4^n - 8)/6.A080675
a(n) = (5*4^n - 8)/6.
- a(1) = 1; for n>1, a(n) is the smallest number > a(n-1) such that the first n terms of the sequence contain a total of a(n) digits.A080676
a(1) = 1; for n>1, a(n) is the smallest number > a(n-1) such that the first n terms of the sequence contain a total of a(n) digits.
- a(n) = n + 1 - A004001(n).A080677
a(n) = n + 1 - A004001(n).
- Rooted at a(0)=0 and a(1)=a(2)=a(3)=1, 4 cases of index mod 4: a(4n)=4*a(n), a(4n+1)= 3*a(n)+a(n+1), a(4n+2) = 2*a(n)+2*a(n+1), and a(4n+3) = a(n)+3*a(n+1).A080678
Rooted at a(0)=0 and a(1)=a(2)=a(3)=1, 4 cases of index mod 4: a(4n)=4*a(n), a(4n+1)= 3*a(n)+a(n+1), a(4n+2) = 2*a(n)+2*a(n+1), and a(4n+3) = a(n)+3*a(n+1).
- Lexicographically earliest de Bruijn cycle of length 16 (repeated indefinitely).A080679
Lexicographically earliest de Bruijn cycle of length 16 (repeated indefinitely).
- Integer part of the square root of the n-th prime of the form 4k+1.A080680
Integer part of the square root of the n-th prime of the form 4k+1.
- 17-smooth numbers: numbers whose prime divisors are all <= 17.A080681
17-smooth numbers: numbers whose prime divisors are all <= 17.
- 19-smooth numbers: numbers whose prime divisors are all <= 19.A080682
19-smooth numbers: numbers whose prime divisors are all <= 19.
- 23-smooth numbers: numbers whose prime divisors are all <= 23.A080683
23-smooth numbers: numbers whose prime divisors are all <= 23.
- Number of 13-smooth numbers <= n.A080684
Number of 13-smooth numbers <= n.
- Number of 17-smooth numbers <= n.A080685
Number of 17-smooth numbers <= n.
- Number of 19-smooth numbers <= n.A080686
Number of 19-smooth numbers <= n.
- Number of labeled n-element posets with no 3-element antichain.A080687
Number of labeled n-element posets with no 3-element antichain.
- Resort the index of A064553 using A080444 and maintaining ascending order within each grouping: seen as a triangle read by rows, the n-th row contains the A001055(n) numbers m with A064553(m)=n.A080688
Resort the index of A064553 using A080444 and maintaining ascending order within each grouping: seen as a triangle read by rows, the n-th row contains the A001055(n) numbers m with A064553(m)=n.
- Powers of 10 that reach ...,7,8,4,2,1 under the mapping: if n is even divide by 2 else add 1.A080689
Powers of 10 that reach ...,7,8,4,2,1 under the mapping: if n is even divide by 2 else add 1.
- Number of acyclic orientations of n X n grid graph.A080690
Number of acyclic orientations of n X n grid graph.
- Number of spanning forests of the n X n grid graph.A080691
Number of spanning forests of the n X n grid graph.
- a(n)=(-1)^(n+1)*det(M(n)) where M(n) is the n X n matrix M(i,j)=min(abs(i-j),i).A080692
a(n)=(-1)^(n+1)*det(M(n)) where M(n) is the n X n matrix M(i,j)=min(abs(i-j),i).
- Numbers of the form p^2*q + r*s where p,q,r,s are (not necessarily distinct) primes.A080693
Numbers of the form p^2*q + r*s where p,q,r,s are (not necessarily distinct) primes.
- Let u(1)=u(2)=1 and u(k)=abs(u(k-1)-u(k-2)-n); sequence gives length of period of u(k).A080694
Let u(1)=u(2)=1 and u(k)=abs(u(k-1)-u(k-2)-n); sequence gives length of period of u(k).
- Concatenation of the prime power factors (with maximal exponent) of n; a(1) = 1 by convention.A080695
Concatenation of the prime power factors (with maximal exponent) of n; a(1) = 1 by convention.
- Piptorial numbers = product of first n pips or prime-indexed primes.A080696
Piptorial numbers = product of first n pips or prime-indexed primes.
- a(n) = n * prime(prime(n)).A080697
a(n) = n * prime(prime(n)).
- Product of twin-prime-indexed primes and their lower bound twin prime.A080698
Product of twin-prime-indexed primes and their lower bound twin prime.
- Product of twin-prime-indexed primes and their upper bound twin prime.A080699
Product of twin-prime-indexed primes and their upper bound twin prime.
- Product of upper bound twin-prime-indexed primes and their lower bound twin prime.A080700
Product of upper bound twin-prime-indexed primes and their lower bound twin prime.
- Product of upper bound twin-prime-indexed primes and their upper bound twin prime.A080701
Product of upper bound twin-prime-indexed primes and their upper bound twin prime.
- a(1)=3; for n>1, a(n) = smallest number > a(n-1) such that the condition "if n is in the sequence then a(n) is even" is satisfied.A080702
a(1)=3; for n>1, a(n) = smallest number > a(n-1) such that the condition "if n is in the sequence then a(n) is even" is satisfied.
- a(1)=5; for n>1, a(n) = smallest number > a(n-1) such that the condition "if n is in the sequence then a(n) is a multiple of 4" is satisfied.A080703
a(1)=5; for n>1, a(n) = smallest number > a(n-1) such that the condition "if n is in the sequence then a(n) is a multiple of 4" is satisfied.
- a(1)=2; for n>1, if n is in the sequence then a(n) is the smallest even integer > a(n-1), otherwise a(n) = a(n-1) + 3.A080704
a(1)=2; for n>1, if n is in the sequence then a(n) is the smallest even integer > a(n-1), otherwise a(n) = a(n-1) + 3.
- Numbers n such that A080704(n+1) - A080704(n) = 1.A080705
Numbers n such that A080704(n+1) - A080704(n) = 1.
- Powers of 3 that reach ...,7,8,4,2,1 under the mapping: if n is even divide by 2 else add 1.A080706
Powers of 3 that reach ...,7,8,4,2,1 under the mapping: if n is even divide by 2 else add 1.
- a(1)=5; for n>1, a(n) = smallest number > a(n-1) such that the condition "n is in the sequence if and only if a(n) is a multiple of 3" is satisfied.A080707
a(1)=5; for n>1, a(n) = smallest number > a(n-1) such that the condition "n is in the sequence if and only if a(n) is a multiple of 3" is satisfied.
- a(1)=5; for n>1, a(n) = smallest number > a(n-1) such that the condition "n is in the sequence if and only if a(n) is a multiple of 4" is satisfied.A080708
a(1)=5; for n>1, a(n) = smallest number > a(n-1) such that the condition "n is in the sequence if and only if a(n) is a multiple of 4" is satisfied.
- Take sum of squares of digits of previous term, starting with 4.A080709
Take sum of squares of digits of previous term, starting with 4.
- a(0) = 1; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a multiple of 3".A080710
a(0) = 1; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a multiple of 3".