Sequences

392,541 sequences

a(n) = ceiling(n*phi^5), where phi is the golden ratio, A001622.A004960
a(n) = ceiling(n*phi^5), where phi is the golden ratio, A001622.
a(n) = ceiling(n*phi^6), where phi is the golden ratio.A004961
a(n) = ceiling(n*phi^6), where phi is the golden ratio.
a(n) = ceiling(n*phi^7), where phi is the golden ratio, A001622.A004962
a(n) = ceiling(n*phi^7), where phi is the golden ratio, A001622.
a(n) = ceiling(n*phi^8), where phi is the golden ratio, A001622.A004963
a(n) = ceiling(n*phi^8), where phi is the golden ratio, A001622.
a(n) = ceiling(n*phi^9), where phi is the golden ratio, A001622.A004964
a(n) = ceiling(n*phi^9), where phi is the golden ratio, A001622.
a(n) = ceiling(n*phi^10), where phi is the golden ratio, A001622.A004965
a(n) = ceiling(n*phi^10), where phi is the golden ratio, A001622.
a(n) = ceiling(n*phi^11), where phi is the golden ratio, A001622.A004966
a(n) = ceiling(n*phi^11), where phi is the golden ratio, A001622.
a(n) = ceiling(n*phi^12), where phi is the golden ratio, A001622.A004967
a(n) = ceiling(n*phi^12), where phi is the golden ratio, A001622.
a(n) = ceiling(n*phi^13), where phi is the golden ratio, A001622.A004968
a(n) = ceiling(n*phi^13), where phi is the golden ratio, A001622.
a(n) = ceiling(n*phi^14), where phi is the golden ratio, A001622.A004969
a(n) = ceiling(n*phi^14), where phi is the golden ratio, A001622.
a(n) = ceiling(n*phi^15), where phi is the golden ratio, A001622.A004970
a(n) = ceiling(n*phi^15), where phi is the golden ratio, A001622.
a(n) = ceiling(n*phi^16), where phi is the golden ratio, A001622.A004971
a(n) = ceiling(n*phi^16), where phi is the golden ratio, A001622.
a(n) = ceiling(n*phi^17), where phi is the golden ratio, A001622.A004972
a(n) = ceiling(n*phi^17), where phi is the golden ratio, A001622.
a(n) = ceiling(n*phi^18), where phi is the golden ratio, A001622.A004973
a(n) = ceiling(n*phi^18), where phi is the golden ratio, A001622.
a(n) = ceiling(n*phi^19), where phi is the golden ratio, A001622.A004974
a(n) = ceiling(n*phi^19), where phi is the golden ratio, A001622.
a(n) = ceiling(n*phi^20), where phi is the golden ratio, A001622.A004975
a(n) = ceiling(n*phi^20), where phi is the golden ratio, A001622.
a(n) = floor(n*phi^3), where phi=(1+sqrt(5))/2.A004976
a(n) = floor(n*phi^3), where phi=(1+sqrt(5))/2.
Sum of digits of n-th term in Look and Say sequence A005150.A004977
Sum of digits of n-th term in Look and Say sequence A005150.
a(n) = least integer m > a(n-1) such that m - a(n-1) != a(j) - a(k) for all j, k less than n; a(1) = 1, a(2) = 2.A004978
a(n) = least integer m > a(n-1) such that m - a(n-1) != a(j) - a(k) for all j, k less than n; a(1) = 1, a(2) = 2.
a(n)=least number m such that m-a(n-1)<>a(j)-a(k) for all j,k less than m; a(1)=1, a(2)=3.A004979
a(n)=least number m such that m-a(n-1)<>a(j)-a(k) for all j,k less than m; a(1)=1, a(2)=3.
Numbers k such that if 1 <= j < k then the fractional part of the k-th partial sum of the harmonic series > the fractional part of the j-th partial sum of the harmonic series.A004980
Numbers k such that if 1 <= j < k then the fractional part of the k-th partial sum of the harmonic series > the fractional part of the j-th partial sum of the harmonic series.
a(n) = (2^n/n!) * Product_{k=0..n-1} (4*k + 1).A004981
a(n) = (2^n/n!) * Product_{k=0..n-1} (4*k + 1).
a(n) = (2^n/n!) * Product_{k=0..n-1} (4*k + 3).A004982
a(n) = (2^n/n!) * Product_{k=0..n-1} (4*k + 3).
a(n) = (2^n/n!) * Product_{k=0..n-1} (4*k - 3).A004983
a(n) = (2^n/n!) * Product_{k=0..n-1} (4*k - 3).
a(n) = (2^n/n!)*Product_{k=0..n-1} (4*k - 1).A004984
a(n) = (2^n/n!)*Product_{k=0..n-1} (4*k - 1).
a(n) = (2^n/n!)*Product_{k=0..n-1} (4*k + 5).A004985
a(n) = (2^n/n!)*Product_{k=0..n-1} (4*k + 5).
a(n) = (2^n/n!) * Product_{k=0..n-1} (4*k + 7).A004986
a(n) = (2^n/n!) * Product_{k=0..n-1} (4*k + 7).
a(n) = (3^n/n!)*Product_{k=0..n-1} (3*k + 1). 3-central binomial coefficients.A004987
a(n) = (3^n/n!)*Product_{k=0..n-1} (3*k + 1). 3-central binomial coefficients.
a(n) = (3^n/n!) * Product_{k=0..n-1} (3*k + 2).A004988
a(n) = (3^n/n!) * Product_{k=0..n-1} (3*k + 2).
a(n) = (3^n/n!) * Product_{k=0..n-1} (3*k - 2).A004989
a(n) = (3^n/n!) * Product_{k=0..n-1} (3*k - 2).
a(n) = (3^n/n!)*Product_{k=0..n-1} (3*k - 1).A004990
a(n) = (3^n/n!)*Product_{k=0..n-1} (3*k - 1).
a(n) = (3^n/n!) * Product_{k=0..n-1} (3*k + 4).A004991
a(n) = (3^n/n!) * Product_{k=0..n-1} (3*k + 4).
a(n) = (3^n/n!) * Product_{k=0..n-1} (3*k + 5).A004992
a(n) = (3^n/n!) * Product_{k=0..n-1} (3*k + 5).
a(n) = (6^n/n!)*Product_{k=0..n-1} (6*k + 1).A004993
a(n) = (6^n/n!)*Product_{k=0..n-1} (6*k + 1).
a(n) = (6^n/n!)*Product_{k=0..n-1} (6*k + 5).A004994
a(n) = (6^n/n!)*Product_{k=0..n-1} (6*k + 5).
a(n) = (6^n/n!) * Product_{k=0..n-1} (6*k - 5).A004995
a(n) = (6^n/n!) * Product_{k=0..n-1} (6*k - 5).
a(n) = 6^n/n! * Product_{k=0..n-1} (6*k - 1).A004996
a(n) = 6^n/n! * Product_{k=0..n-1} (6*k - 1).
a(n) = (6^n/n!) * Product_{k=0..n-1} (6*k + 7).A004997
a(n) = (6^n/n!) * Product_{k=0..n-1} (6*k + 7).
a(n) = (6^n/n!) * Product_{k=0..n-1} ( 6*k + 11 ).A004998
a(n) = (6^n/n!) * Product_{k=0..n-1} ( 6*k + 11 ).
Sums of two nonnegative cubes.A004999
Sums of two nonnegative cubes.
Erroneous version of A006505.A005000
Erroneous version of A006505.
a(n) = Sum_{k=0..n-1} Bell(k), where the Bell numbers Bell(k) are given in A000110.A005001
a(n) = Sum_{k=0..n-1} Bell(k), where the Bell numbers Bell(k) are given in A000110.
Number of rhyme schemes (see reference for precise definition).A005002
Number of rhyme schemes (see reference for precise definition).
Number of rhyme schemes (see reference for precise definition).A005003
Number of rhyme schemes (see reference for precise definition).
Davenport-Schinzel numbers of degree n on 3 symbols.A005004
Davenport-Schinzel numbers of degree n on 3 symbols.
Davenport-Schinzel numbers of degree n on 4 symbols.A005005
Davenport-Schinzel numbers of degree n on 4 symbols.
Davenport-Schinzel numbers of degree n on 5 symbols.A005006
Davenport-Schinzel numbers of degree n on 5 symbols.
Number of cubic (i.e., regular of degree 3) generalized Moore graphs with 2n nodes.A005007
Number of cubic (i.e., regular of degree 3) generalized Moore graphs with 2n nodes.
a(n) = n! - n^2.A005008
a(n) = n! - n^2.
a(n) = 7*2^n.A005009
a(n) = 7*2^n.