Sequences
392,541 sequences
- Number of i such that |d(i) - d(i-1)| = 1, where Sum_{i=0..m} d(i)*8^i is the base-8 representation of n.A037911
Number of i such that |d(i) - d(i-1)| = 1, where Sum_{i=0..m} d(i)*8^i is the base-8 representation of n.
- Number of i such that |d(i) - d(i-1)| = 1, where Sum_{i=0..m} d(i)*9^i is the base-9 representation of n.A037912
Number of i such that |d(i) - d(i-1)| = 1, where Sum_{i=0..m} d(i)*9^i is the base-9 representation of n.
- Number of i such that |d(i) - d(i-1)| = 1, where Sum_{i=0..m} d(i)*10^i is the base-10 representation of n.A037913
Number of i such that |d(i) - d(i-1)| = 1, where Sum_{i=0..m} d(i)*10^i is the base-10 representation of n.
- a(n) is the least base b>=2 such that the number of distinct digits in the base b representation of n is maximized.A037914
a(n) is the least base b>=2 such that the number of distinct digits in the base b representation of n is maximized.
- a(n) = floor((3*n + 4)/4).A037915
a(n) = floor((3*n + 4)/4).
- Concatenate exponents in prime factorization of n.A037916
Concatenate exponents in prime factorization of n.
- Numbers n such that the Fibonacci number F(n) is divisible by a square.A037917
Numbers n such that the Fibonacci number F(n) is divisible by a square.
- Numbers n such that the Fibonacci number F(n) is squarefree.A037918
Numbers n such that the Fibonacci number F(n) is squarefree.
- Trajectory of 4 under prime factor concatenation procedure.A037919
Trajectory of 4 under prime factor concatenation procedure.
- Trajectory of 8 under prime factor concatenation procedure.A037920
Trajectory of 8 under prime factor concatenation procedure.
- Trajectory of 9 under prime factor concatenation procedure.A037921
Trajectory of 9 under prime factor concatenation procedure.
- Trajectory of 10 under prime factor concatenation procedure.A037922
Trajectory of 10 under prime factor concatenation procedure.
- Trajectory of 14 under prime factor concatenation procedure.A037923
Trajectory of 14 under prime factor concatenation procedure.
- Trajectory of 15 under prime factor concatenation procedure.A037924
Trajectory of 15 under prime factor concatenation procedure.
- Trajectory of 16 under prime factor concatenation procedure.A037925
Trajectory of 16 under prime factor concatenation procedure.
- Trajectory of 20 under prime factor concatenation procedure.A037926
Trajectory of 20 under prime factor concatenation procedure.
- Trajectory of 24 under prime factor concatenation procedure.A037927
Trajectory of 24 under prime factor concatenation procedure.
- Trajectory of 25 under prime factor concatenation procedure.A037928
Trajectory of 25 under prime factor concatenation procedure.
- Trajectory of 26 under prime factor concatenation procedure.A037929
Trajectory of 26 under prime factor concatenation procedure.
- Trajectory of 27 under prime factor concatenation procedure.A037930
Trajectory of 27 under prime factor concatenation procedure.
- Trajectory of 30 under prime factor concatenation procedure.A037931
Trajectory of 30 under prime factor concatenation procedure.
- Trajectory of 32 under prime factor concatenation procedure.A037932
Trajectory of 32 under prime factor concatenation procedure.
- Trajectory of 34 under prime factor concatenation procedure.A037933
Trajectory of 34 under prime factor concatenation procedure.
- Trajectory of 35 under prime factor concatenation procedure.A037934
Trajectory of 35 under prime factor concatenation procedure.
- Trajectory of 36 under prime factor concatenation procedure.A037935
Trajectory of 36 under prime factor concatenation procedure.
- Trajectory of 38 under prime factor concatenation procedure.A037936
Trajectory of 38 under prime factor concatenation procedure.
- Trajectory of 40 under prime factor concatenation procedure.A037937
Trajectory of 40 under prime factor concatenation procedure.
- Trajectory of 42 under prime factor concatenation procedure.A037938
Trajectory of 42 under prime factor concatenation procedure.
- Trajectory of 44 under prime factor concatenation procedure.A037939
Trajectory of 44 under prime factor concatenation procedure.
- Trajectory of 45 under prime factor concatenation procedure.A037940
Trajectory of 45 under prime factor concatenation procedure.
- Trajectory of 48 under prime factor concatenation procedure.A037941
Trajectory of 48 under prime factor concatenation procedure.
- Numbers of the form x^2 + y^2 with x >= 0, y >= 0, gcd(x,y)=1, with multiplicity.A037942
Numbers of the form x^2 + y^2 with x >= 0, y >= 0, gcd(x,y)=1, with multiplicity.
- Smallest Fibonacci number that has n as a factor, divided by n.A037943
Smallest Fibonacci number that has n as a factor, divided by n.
- Coefficients of unique normalized cusp form Delta_18 of weight 18 for full modular group.A037944
Coefficients of unique normalized cusp form Delta_18 of weight 18 for full modular group.
- Coefficients of unique normalized cusp form Delta_20 of weight 20 for full modular group.A037945
Coefficients of unique normalized cusp form Delta_20 of weight 20 for full modular group.
- Coefficients of unique normalized cusp form Delta_22 of weight 22 for full modular group.A037946
Coefficients of unique normalized cusp form Delta_22 of weight 22 for full modular group.
- Coefficients of unique normalized cusp form Delta_26 of weight 26 for full modular group.A037947
Coefficients of unique normalized cusp form Delta_26 of weight 26 for full modular group.
- Duplicate of A007659.A037948
Duplicate of A007659.
- Primes at which cusp form Delta_16 is not ordinary.A037949
Primes at which cusp form Delta_16 is not ordinary.
- Primes at which cusp form Delta_20 is not ordinary.A037950
Primes at which cusp form Delta_20 is not ordinary.
- a(n) = binomial(n, floor((n-3)/2)).A037951
a(n) = binomial(n, floor((n-3)/2)).
- a(n) = binomial(n, floor((n-1)/2)).A037952
a(n) = binomial(n, floor((n-1)/2)).
- a(n) = binomial(n, floor((n-5)/2)).A037953
a(n) = binomial(n, floor((n-5)/2)).
- a(n) = binomial(n, floor((n-7)/2)).A037954
a(n) = binomial(n, floor((n-7)/2)).
- a(n) = binomial(n, floor(n/2)-1).A037955
a(n) = binomial(n, floor(n/2)-1).
- a(n) = binomial(n, floor((n-4)/2)).A037956
a(n) = binomial(n, floor((n-4)/2)).
- a(n) = binomial(n, floor((n-6)/2)).A037957
a(n) = binomial(n, floor((n-6)/2)).
- a(n) = binomial(n, floor((n-8)/2)).A037958
a(n) = binomial(n, floor((n-8)/2)).
- a(n) = n^2*(n+1)*(n+2)!/48.A037959
a(n) = n^2*(n+1)*(n+2)!/48.
- a(n) = n*(3*n+1)*(n+2)!/24.A037960
a(n) = n*(3*n+1)*(n+2)!/24.