Sequences
392,541 sequences
- Number of binary arrangements without adjacent 1's on n X n torus connected n-s.A067961
Number of binary arrangements without adjacent 1's on n X n torus connected n-s.
- a(n) = F(n+2)*(Product_{i=1..n+1} F(i))^2 where F(i)=A000045(i) is the i-th Fibonacci number.A067962
a(n) = F(n+2)*(Product_{i=1..n+1} F(i))^2 where F(i)=A000045(i) is the i-th Fibonacci number.
- Number of binary arrangements without adjacent 1's on n X n array connected e-w ne-sw nw-se.A067963
Number of binary arrangements without adjacent 1's on n X n array connected e-w ne-sw nw-se.
- Number of binary arrangements without adjacent 1's on n X n array connected n-s nw-se.A067964
Number of binary arrangements without adjacent 1's on n X n array connected n-s nw-se.
- Number of binary arrangements without adjacent 1's on n X n array connected ne-sw and nw-se.A067965
Number of binary arrangements without adjacent 1's on n X n array connected ne-sw and nw-se.
- Number of binary arrangements without adjacent 1's on n X n array connected n-s.A067966
Number of binary arrangements without adjacent 1's on n X n array connected n-s.
- Number of binary arrangements without adjacent 1's on n X n hexagonal staggered torus shifted for odd n.A067967
Number of binary arrangements without adjacent 1's on n X n hexagonal staggered torus shifted for odd n.
- Number of binary arrangements on n X n array without adjacent three 1's.A067968
Number of binary arrangements on n X n array without adjacent three 1's.
- Number of nodes in virtual, "optimal", chordal graphs of diameter 5, degree =n+1.A067969
Number of nodes in virtual, "optimal", chordal graphs of diameter 5, degree =n+1.
- First differences of A014076, the odd nonprimes.A067970
First differences of A014076, the odd nonprimes.
- a(n+1) is the smallest number > a(n) such that the digits of a(n)^3 are all (with multiplicity) properly contained in the digits of a(n+1)^3, with a(0)=1.A067971
a(n+1) is the smallest number > a(n) such that the digits of a(n)^3 are all (with multiplicity) properly contained in the digits of a(n+1)^3, with a(0)=1.
- a(n+1) is the smallest cube > a(n) such that the digits of a(n) are all (with multiplicity) properly contained in the digits of a(n+1), with a(0)=1.A067972
a(n+1) is the smallest cube > a(n) such that the digits of a(n) are all (with multiplicity) properly contained in the digits of a(n+1), with a(0)=1.
- a(n+1) is the smallest number > a(n) such that the digits of a(n)^3 are all (with multiplicity) contained in the digits of a(n+1)^3, with a(0)=1.A067973
a(n+1) is the smallest number > a(n) such that the digits of a(n)^3 are all (with multiplicity) contained in the digits of a(n+1)^3, with a(0)=1.
- a(n+1) is the smallest cube > a(n) such that the digits of a(n) are all (with multiplicity) contained in the digits of a(n+1), with a(0)=1.A067974
a(n+1) is the smallest cube > a(n) such that the digits of a(n) are all (with multiplicity) contained in the digits of a(n+1), with a(0)=1.
- a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) contained in the digits of a(n+1)^2, with a(0)=2.A067975
a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) contained in the digits of a(n+1)^2, with a(0)=2.
- Primes of the form 1 + k^phi(k).A067976
Primes of the form 1 + k^phi(k).
- Convolution of Fibonacci F(n+1), n>=0, with F(n+9), n>=0.A067977
Convolution of Fibonacci F(n+1), n>=0, with F(n+9), n>=0.
- Convolution of Fibonacci F(n+1), n>=0, with F(n+10), n>=0.A067978
Convolution of Fibonacci F(n+1), n>=0, with F(n+10), n>=0.
- Triangle read by rows of incomplete convolutions of Lucas numbers L(n+1) = A000204(n+1), n>=0.A067979
Triangle read by rows of incomplete convolutions of Lucas numbers L(n+1) = A000204(n+1), n>=0.
- Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+2), n>=0.A067980
Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+2), n>=0.
- Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+3), n>=0.A067981
Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+3), n>=0.
- Convolution of L(n+1) = A000204(n+1), n>=0, with L(n+4), n>=0.A067982
Convolution of L(n+1) = A000204(n+1), n>=0, with L(n+4), n>=0.
- Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+5), n>=0.A067983
Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+5), n>=0.
- Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+6), n>=0.A067984
Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+6), n>=0.
- Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+7), n>=0.A067985
Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+7), n>=0.
- Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+8), n>=0.A067986
Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+8), n>=0.
- Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+9), n>=0.A067987
Convolution of L(n+1) := A000204(n+1) (Lucas), n>=0, with L(n+9), n>=0.
- Row sums of triangle A067330; also of triangle A067418.A067988
Row sums of triangle A067330; also of triangle A067418.
- Row sums of triangle A067979; also of triangle A067990.A067989
Row sums of triangle A067979; also of triangle A067990.
- Triangle A067979 with rows read backwards.A067990
Triangle A067979 with rows read backwards.
- a(n) = k such that the k-th triangular number is A068808(n).A067991
a(n) = k such that the k-th triangular number is A068808(n).
- a(0)=1 and, for n > 0, a(n) is the smallest positive integer such that the ratios min(a(k)/a(k-1), a(k-1)/a(k)) for 0 < k <= n are all distinct.A067992
a(0)=1 and, for n > 0, a(n) is the smallest positive integer such that the ratios min(a(k)/a(k-1), a(k-1)/a(k)) for 0 < k <= n are all distinct.
- Consider the sequence of ratios min(t(n-1)/t(n), t(n)/t(n-1)), n=2,3,4,..., where the t(n) are the terms of A067992. Let m be the smallest integer such that all fractions 1/n, 2/n, ..., (n-1)/n have appeared when we reach A067992(m); this sequence gives the values of m; set a(n)=0 if some fraction i/n never appears.A067993
Consider the sequence of ratios min(t(n-1)/t(n), t(n)/t(n-1)), n=2,3,4,..., where the t(n) are the terms of A067992. Let m be the smallest integer such that all fractions 1/n, 2/n, ..., (n-1)/n have appeared when we reach A067992(m); this sequence gives the values of m; set a(n)=0 if some fraction i/n never appears.
- Hermite numbers.A067994
Hermite numbers.
- Minimal number of coins needed to pay exactly n cents using coins of sizes 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage from 1 to 100 cents).A067995
Minimal number of coins needed to pay exactly n cents using coins of sizes 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage from 1 to 100 cents).
- Number of ways of making change for n cents using coins of 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage from 1 to 100 cents).A067996
Number of ways of making change for n cents using coins of 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage from 1 to 100 cents).
- Number of (unordered) ways of making change for n cents using coins of 1/2, 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage denominations up to 100 cents).A067997
Number of (unordered) ways of making change for n cents using coins of 1/2, 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage denominations up to 100 cents).
- a(n) = n^2 - 2*n.A067998
a(n) = n^2 - 2*n.
- Numbers k such that (k! - 1) == 0 (mod prime(k)).A067999
Numbers k such that (k! - 1) == 0 (mod prime(k)).
- Numbers k such that (k! + 1) == 0 ( mod prime(k) ).A068000
Numbers k such that (k! + 1) == 0 ( mod prime(k) ).
- Smallest number whose n-th power (A067457) starts with n.A068001
Smallest number whose n-th power (A067457) starts with n.
- a(1) = 3, a(n+1) is the concatenation of a(n) and the next prime after a(n).A068002
a(1) = 3, a(n+1) is the concatenation of a(n) and the next prime after a(n).
- a(1) = 5, a(n+1) is the concatenation of a(n) and the next prime after a(n).A068003
a(1) = 5, a(n+1) is the concatenation of a(n) and the next prime after a(n).
- a(1) = 7, a(n+1) is the concatenation of a(n) and the next prime after a(n).A068004
a(1) = 7, a(n+1) is the concatenation of a(n) and the next prime after a(n).
- Numbers n such that n*sigma(n) > phi(n)*prime(n).A068005
Numbers n such that n*sigma(n) > phi(n)*prime(n).
- Number of partitions of n into distinct partition numbers.A068006
Number of partitions of n into distinct partition numbers.
- Least number k such that the number of primes of the form [k/j] for j=1..k (A068050) is n, or zero if impossible.A068007
Least number k such that the number of primes of the form [k/j] for j=1..k (A068050) is n, or zero if impossible.
- Least number needed to be appended to n n's to make a prime that does not contain more than n n's in a row.A068008
Least number needed to be appended to n n's to make a prime that does not contain more than n n's in a row.
- Square array T(m,n) with m (row) >= 1 and n (column) >= 0 read by antidiagonals: number of subsets of {1,2,3,...n} that sum to 0 mod m (including the empty set, whose sum is 0).A068009
Square array T(m,n) with m (row) >= 1 and n (column) >= 0 read by antidiagonals: number of subsets of {1,2,3,...n} that sum to 0 mod m (including the empty set, whose sum is 0).
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 3.A068010
Number of subsets of {1,2,3,...,n} that sum to 0 mod 3.