Sequences
392,541 sequences
- Period 6: repeat [1, 1, 1, 0, 0, 0].A088911
Period 6: repeat [1, 1, 1, 0, 0, 0].
- a(n) = smallest m such that sigma(m) = (n+1/2)*m.A088912
a(n) = smallest m such that sigma(m) = (n+1/2)*m.
- a(n) = (Lucas(2n) + Lucas(2n+1)*phi)/kappa(phi/Fibonacci(4n)) where kappa(x) is the sum of successive remainders in computing the Euclidean algorithm for (1,x).A088913
a(n) = (Lucas(2n) + Lucas(2n+1)*phi)/kappa(phi/Fibonacci(4n)) where kappa(x) is the sum of successive remainders in computing the Euclidean algorithm for (1,x).
- a(n) = (Fibonacci(2n+1) + Fibonacci(2n+2)*phi)/kappa(phi/Fibonacci(4n+2)) where kappa(x) is the sum of successive remainders by computing the Euclidean algorithm for (1,x).A088914
a(n) = (Fibonacci(2n+1) + Fibonacci(2n+2)*phi)/kappa(phi/Fibonacci(4n+2)) where kappa(x) is the sum of successive remainders by computing the Euclidean algorithm for (1,x).
- Nonnegative numbers of the form mn(m+n) with integers m,n.A088915
Nonnegative numbers of the form mn(m+n) with integers m,n.
- Triangular array read by rows, 2<=k<=n: T(n,k) = smallest number that in base k representation is not contained in n^n.A088916
Triangular array read by rows, 2<=k<=n: T(n,k) = smallest number that in base k representation is not contained in n^n.
- Central Delannoy numbers (mod 3); Characteristic function for Cantor set.A088917
Central Delannoy numbers (mod 3); Characteristic function for Cantor set.
- Number of representations of n as sum of two squares of distinct primes.A088918
Number of representations of n as sum of two squares of distinct primes.
- Smallest number having exactly n representations as sum of two squares of distinct primes.A088919
Smallest number having exactly n representations as sum of two squares of distinct primes.
- Solutions k to the Diophantine equation k = 2n^2 = m^2+1.A088920
Solutions k to the Diophantine equation k = 2n^2 = m^2+1.
- The number of 321- and 2143-avoiding permutations of length n.A088921
The number of 321- and 2143-avoiding permutations of length n.
- Consider the n X n matrix with entries (i*j mod n), where i,j=0..n-1; a(n) = rank of this matrix over the real numbers.A088922
Consider the n X n matrix with entries (i*j mod n), where i,j=0..n-1; a(n) = rank of this matrix over the real numbers.
- Duplicate of A011539.A088923
Duplicate of A011539.
- Number of "9ish numbers" with n digits.A088924
Number of "9ish numbers" with n digits.
- Square table, read by antidiagonals, of coefficients T(n,k) of x^n*y^k in f(x,y) that satisfies f(x,y) = 1/(1-x-y) + xy*f(x,y)^3.A088925
Square table, read by antidiagonals, of coefficients T(n,k) of x^n*y^k in f(x,y) that satisfies f(x,y) = 1/(1-x-y) + xy*f(x,y)^3.
- Main diagonal of table A088925, which lists coefficients T(n,k) of x^n*y^k in f(x,y) that satisfies f(x,y) = 1/(1-x-y) + xy*f(x,y)^3.A088926
Main diagonal of table A088925, which lists coefficients T(n,k) of x^n*y^k in f(x,y) that satisfies f(x,y) = 1/(1-x-y) + xy*f(x,y)^3.
- Antidiagonal sums of table A088925, which lists coefficients T(n,k) of x^n*y^k in f(x,y) that satisfies f(x,y) = 1/(1-x-y) + xy*f(x,y)^3.A088927
Antidiagonal sums of table A088925, which lists coefficients T(n,k) of x^n*y^k in f(x,y) that satisfies f(x,y) = 1/(1-x-y) + xy*f(x,y)^3.
- Decimal expansion of Pi/LambertW(Pi).A088928
Decimal expansion of Pi/LambertW(Pi).
- Coefficient of x^n in A(x)^n is A087457(n) for n>=1.A088929
Coefficient of x^n in A(x)^n is A087457(n) for n>=1.
- Sum of first n terms of A(x)^n is A087457(n) for n>=1.A088930
Sum of first n terms of A(x)^n is A087457(n) for n>=1.
- G.f.: Sum_{n >= 1} ( x^(2^n)/ ((1+x^(2^(n-1)))*Product_{j=0..n-1} (1-x^(2^j)) ) ).A088931
G.f.: Sum_{n >= 1} ( x^(2^n)/ ((1+x^(2^(n-1)))*Product_{j=0..n-1} (1-x^(2^j)) ) ).
- G.f.: 1/((1-x)^2*(1-x^2)*(1-x^4)*(1-x^8)).A088932
G.f.: 1/((1-x)^2*(1-x^2)*(1-x^4)*(1-x^8)).
- Number of generalized Moore graphs on n nodes.A088933
Number of generalized Moore graphs on n nodes.
- Maximum prime required for the representation of n by a signed sum of squares of distinct primes that has the minimal number of terms A088910(n).A088934
Maximum prime required for the representation of n by a signed sum of squares of distinct primes that has the minimal number of terms A088910(n).
- Numbers n such that leading digits of 2^n and 5^n are equal.A088935
Numbers n such that leading digits of 2^n and 5^n are equal.
- a(1)=1, a(2)=2 then a(A(k))=a(k) where a(1),a(2),...,a(k) are k consecutive defined terms and A(k)=a(1)+a(2)+...+a(k). Fill in any undefined places with max{a(i)+1 : 1<=i<=k}.A088936
a(1)=1, a(2)=2 then a(A(k))=a(k) where a(1),a(2),...,a(k) are k consecutive defined terms and A(k)=a(1)+a(2)+...+a(k). Fill in any undefined places with max{a(i)+1 : 1<=i<=k}.
- Partial sums of A088936.A088937
Partial sums of A088936.
- Occurrences of 2's in A088936.A088938
Occurrences of 2's in A088936.
- Runs are reduced to one term in A088936.A088939
Runs are reduced to one term in A088936.
- Partial sums of A088939.A088940
Partial sums of A088939.
- a(n)=12*sum(1<=i<=j<=k<=n,i*j/k).A088941
a(n)=12*sum(1<=i<=j<=k<=n,i*j/k).
- a(n)=60*sum(1<=i<=j<=k<=n,i^2*j/k).A088942
a(n)=60*sum(1<=i<=j<=k<=n,i^2*j/k).
- a(n)=60*sum(1<=i<=j<=k<=n,i*j^2/k).A088943
a(n)=60*sum(1<=i<=j<=k<=n,i*j^2/k).
- a(n) = least k such that for any m>=0 k*sum(1<=u<=v<=w<=m,u^n*v/w) is an integer.A088944
a(n) = least k such that for any m>=0 k*sum(1<=u<=v<=w<=m,u^n*v/w) is an integer.
- a(n) =60*sum(1<=u<=v<=w<=m,u^2*v^2/w).A088945
a(n) =60*sum(1<=u<=v<=w<=m,u^2*v^2/w).
- Coefficient of x^n of A(x)^n is A005651(n), which is the sum of multinomial coefficients for n.A088946
Coefficient of x^n of A(x)^n is A005651(n), which is the sum of multinomial coefficients for n.
- Positions of records in A069862.A088947
Positions of records in A069862.
- Numbers k such that (A006530(k) + A020639(k))/2 is an integer; that is, arithmetic mean of least and largest prime factor is an integer.A088948
Numbers k such that (A006530(k) + A020639(k))/2 is an integer; that is, arithmetic mean of least and largest prime factor is an integer.
- Composite numbers k such that (A006530(k) + A020639(k))/2 is an integer that divides k; special terms of A088948.A088949
Composite numbers k such that (A006530(k) + A020639(k))/2 is an integer that divides k; special terms of A088948.
- Number of square-subwords in ternary representation of n.A088950
Number of square-subwords in ternary representation of n.
- Number of distinct square-subwords in ternary representation of n.A088951
Number of distinct square-subwords in ternary representation of n.
- Numbers that are squarefree words in ternary representation.A088952
Numbers that are squarefree words in ternary representation.
- Number of numbers that are ternary squarefree words of length n.A088953
Number of numbers that are ternary squarefree words of length n.
- G.f.: 1/((1-x)^2*(1-x^2)*(1-x^4)*(1-x^8)*(1-x^16)).A088954
G.f.: 1/((1-x)^2*(1-x^2)*(1-x^4)*(1-x^8)*(1-x^16)).
- Primes of the form 60*n + 1.A088955
Primes of the form 60*n + 1.
- Triangle, read by rows, of coefficients of the hyperbinomial transform.A088956
Triangle, read by rows, of coefficients of the hyperbinomial transform.
- Hyperbinomial transform of the sequence of 1's.A088957
Hyperbinomial transform of the sequence of 1's.
- Numbers n such that 60*n+1 is prime.A088958
Numbers n such that 60*n+1 is prime.
- Lowest numbers which are d-Pythagorean decomposable, i.e., square is expressible as sum of two positive squares in more ways than for any smaller number.A088959
Lowest numbers which are d-Pythagorean decomposable, i.e., square is expressible as sum of two positive squares in more ways than for any smaller number.
- Triangle read by rows: T(n,k) = number of configurations of k non-attacking bishops on the white squares of an n X n chessboard (for n even, 0 <= k < n).A088960
Triangle read by rows: T(n,k) = number of configurations of k non-attacking bishops on the white squares of an n X n chessboard (for n even, 0 <= k < n).