Sequences
392,541 sequences
- Number of divisors of n that are congruent to 1 modulo 10.A083911
Number of divisors of n that are congruent to 1 modulo 10.
- Number of divisors of n that are congruent to 2 modulo 10.A083912
Number of divisors of n that are congruent to 2 modulo 10.
- Number of divisors of n that are congruent to 3 modulo 10.A083913
Number of divisors of n that are congruent to 3 modulo 10.
- Number of divisors of n that are congruent to 4 modulo 10.A083914
Number of divisors of n that are congruent to 4 modulo 10.
- Number of divisors of n that are congruent to 5 modulo 10.A083915
Number of divisors of n that are congruent to 5 modulo 10.
- Number of divisors of n that are congruent to 6 modulo 10.A083916
Number of divisors of n that are congruent to 6 modulo 10.
- Number of divisors of n that are congruent to 7 modulo 10.A083917
Number of divisors of n that are congruent to 7 modulo 10.
- Number of divisors of n that are congruent to 8 modulo 10.A083918
Number of divisors of n that are congruent to 8 modulo 10.
- Number of divisors of n that are congruent to 9 modulo 10.A083919
Number of divisors of n that are congruent to 9 modulo 10.
- Number of nontriangular numbers <= n.A083920
Number of nontriangular numbers <= n.
- Start with (1,2) and then concatenate 2^n+1 previous terms, n>=0 and add 2 if a(2^n+1)=1 or add 1 if a(2^n+1)=2.A083921
Start with (1,2) and then concatenate 2^n+1 previous terms, n>=0 and add 2 if a(2^n+1)=1 or add 1 if a(2^n+1)=2.
- Partial sums of A083921.A083922
Partial sums of A083921.
- Characteristic function for A057548.A083923
Characteristic function for A057548.
- Characteristic function for A072795.A083924
Characteristic function for A072795.
- Inverse function of N -> N injection A057548.A083925
Inverse function of N -> N injection A057548.
- Inverse function of N -> N injection A072795.A083926
Inverse function of N -> N injection A072795.
- Inverse function of N -> N injection A057123.A083927
Inverse function of N -> N injection A057123.
- Inverse function of N -> N injection A080298.A083928
Inverse function of N -> N injection A080298.
- Inverse function of N -> N injection A083930.A083929
Inverse function of N -> N injection A083930.
- Map from binary trees of size n to the set of corresponding trivalent plane trees (tpt) represented as size 2n+1 general trees.A083930
Map from binary trees of size n to the set of corresponding trivalent plane trees (tpt) represented as size 2n+1 general trees.
- a(n) = A000695(A014486(n)).A083931
a(n) = A000695(A014486(n)).
- A014486-encoding of the Catalan mountain ranges with only even-length slopes allowed.A083932
A014486-encoding of the Catalan mountain ranges with only even-length slopes allowed.
- A063171-encoding of A083923-trees.A083933
A063171-encoding of A083923-trees.
- A014486-indices of A083932-trees.A083934
A014486-indices of A083932-trees.
- Inverse function of N -> N injection A083934.A083935
Inverse function of N -> N injection A083934.
- A014486-encodings of trivalent plane trees (tpt) represented as (embedded into) a subset of general plane trees.A083936
A014486-encodings of trivalent plane trees (tpt) represented as (embedded into) a subset of general plane trees.
- A014486-encodings of the plane binary trees and plane general trees whose left(most) subtree is just a "stick": \.A083937
A014486-encodings of the plane binary trees and plane general trees whose left(most) subtree is just a "stick": \.
- A014486-indices of binary trees whose left and right subtree are identical.A083938
A014486-indices of binary trees whose left and right subtree are identical.
- A014486-encoding of binary trees whose left and right subtree are identical.A083939
A014486-encoding of binary trees whose left and right subtree are identical.
- A014486-indices of symmetric binary trees.A083940
A014486-indices of symmetric binary trees.
- A014486-encoding of symmetric binary trees.A083941
A014486-encoding of symmetric binary trees.
- Positions of breadth-first-wise encodings (A002542) of the complete binary trees (A084107) in A014486.A083942
Positions of breadth-first-wise encodings (A002542) of the complete binary trees (A084107) in A014486.
- A generalized Jacobsthal sequence.A083943
A generalized Jacobsthal sequence.
- A generalized Jacobsthal sequence.A083944
A generalized Jacobsthal sequence.
- Least integer coefficients of A(x), where 1<=a(n)<=5, such that A(x)^(1/5) consists entirely of integer coefficients.A083945
Least integer coefficients of A(x), where 1<=a(n)<=5, such that A(x)^(1/5) consists entirely of integer coefficients.
- Least integer coefficients of A(x), where 1<=a(n)<=6, such that A(x)^(1/6) consists entirely of integer coefficients.A083946
Least integer coefficients of A(x), where 1<=a(n)<=6, such that A(x)^(1/6) consists entirely of integer coefficients.
- Integer coefficients of A(x), where 1<=a(n)<=7, such that A(x)^(1/7) consists entirely of integer coefficients.A083947
Integer coefficients of A(x), where 1<=a(n)<=7, such that A(x)^(1/7) consists entirely of integer coefficients.
- Integer coefficients of A(x), where 1<=a(n)<=8, such that A(x)^(1/8) consists entirely of integer coefficients.A083948
Integer coefficients of A(x), where 1<=a(n)<=8, such that A(x)^(1/8) consists entirely of integer coefficients.
- Integer coefficients of A(x), where 1<=a(n)<=9, such that A(x)^(1/9) consists entirely of integer coefficients.A083949
Integer coefficients of A(x), where 1<=a(n)<=9, such that A(x)^(1/9) consists entirely of integer coefficients.
- Integer coefficients of A(x), where 1<=a(n)<=10, such that A(x)^(1/10) consists entirely of integer coefficients.A083950
Integer coefficients of A(x), where 1<=a(n)<=10, such that A(x)^(1/10) consists entirely of integer coefficients.
- Least increasing integer coefficients such that A(x)^(1/3) has only integer coefficients.A083951
Least increasing integer coefficients such that A(x)^(1/3) has only integer coefficients.
- Integer coefficients a(n) of A(x), where a(n) = 1 or 2 for all n, such that A(x)^(1/2) has only integer coefficients.A083952
Integer coefficients a(n) of A(x), where a(n) = 1 or 2 for all n, such that A(x)^(1/2) has only integer coefficients.
- Least integer coefficients of A(x), where 1<=a(n)<=3, such that A(x)^(1/3) consists entirely of integer coefficients.A083953
Least integer coefficients of A(x), where 1<=a(n)<=3, such that A(x)^(1/3) consists entirely of integer coefficients.
- Least integer coefficients of A(x), where 1<=a(n)<=4, such that A(x)^(1/4) consists entirely of integer coefficients.A083954
Least integer coefficients of A(x), where 1<=a(n)<=4, such that A(x)^(1/4) consists entirely of integer coefficients.
- Numbers n > 1 such that n^5 - 2 has no prime factor > n.A083955
Numbers n > 1 such that n^5 - 2 has no prime factor > n.
- a(n) = sum of all cyclic permutation of concatenation of first n numbers. In each case the digits of a number are kept together for n>9.A083956
a(n) = sum of all cyclic permutation of concatenation of first n numbers. In each case the digits of a number are kept together for n>9.
- a(n) = product of all cyclic permutation of concatenation of first n numbers. In each case the digits of a number are kept together for n>9.A083957
a(n) = product of all cyclic permutation of concatenation of first n numbers. In each case the digits of a number are kept together for n>9.
- Smallest multiple of n using all digits of (n-1) at least once and no others; or 0 if no such number exists.A083958
Smallest multiple of n using all digits of (n-1) at least once and no others; or 0 if no such number exists.
- Smallest multiple of n using all digits of (n-1) with the same frequency and no others; or 0 if no such number exists.A083959
Smallest multiple of n using all digits of (n-1) with the same frequency and no others; or 0 if no such number exists.
- Smallest palindromic multiple of (n with trailing 0's omitted, A004151) using only nonzero digits of n; all digits must appear; or 0 if no such number exists.A083960
Smallest palindromic multiple of (n with trailing 0's omitted, A004151) using only nonzero digits of n; all digits must appear; or 0 if no such number exists.