19096

Appears in sequences

• a(n) = floor(n*phi^15), where phi is the golden ratio, A001622.at n=14A004930
• a(n) = round(n*phi^15), where phi is the golden ratio, A001622.at n=14A004950
• Poincaré series [or Poincare series] (or Molien series) for mod 2 cohomology of universal W-group W(3).at n=18A014696
• a(n) = (2*n-1)*(n^2 -n +6)/6.at n=38A049480
• Reduced denominators of the coefficients in a series expansion for Gamma[x].at n=29A054380
• Susceptibility series H_4 for 2-dimensional Ising model (divided by 2) for 1 particle excitation.at n=9A055920
• 3rd level triangle related to Eulerian numbers and binomial transforms (A062253 is second level, triangle of Eulerian numbers is first level and triangle with Z(0,0)=1 and Z(n,k)=0 otherwise is 0th level).at n=42A062254
• Growth series for fundamental group of orientable closed surface of genus 2.at n=5A063812
• Reverse of largest prime factor of n = smallest prime factor of n+1; a(1)=1.at n=17A071393
• Number of 5-tuples (v1,v2,v3,v4,v5) of nonnegative integers less than n such that v1 <= v4, v1 <= v5, v2 <= v4 and v3 <= v4.at n=9A085462
• Even pseudoprimes to base 9.at n=24A090083
• Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^4-M)/3, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=31A096035
• Expansion of (48-39*x-10*x^2-36*x^3+40*x^4)/((1-x)*(4*x^2-8*x+1)*(x^2+x+1)).at n=3A110275
• a(0)=0; then a(4*k+1)=a(4*k)+(4*k+1)^2, a(4*k+2)=a(4*k+1)+(4*k+3)^2, a(4*k+3)=a(4*k+2)+(4*k+2)^2, a(4*k+4)=a(4*k+3)+(4*k+4)^2.at n=38A115391
• a(n) is the index of the smallest Carmichael number (A002997) with n prime divisors, or 0 if no such number exists.at n=6A135719
• a(n) = -A141055(n)/(n+1)!.at n=29A141321
• Numbers m such that Sum_{i=1..m} omega(i)^2 is divisible by m, where omega is A001221.at n=6A145191
• 4 times heptagonal numbers: a(n) = 2*n*(5*n-3).at n=44A153784
• The number of ordered ways to achieve a score of n in American football.at n=30A160993
• Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k double descents and initial descents (n>=0; 0<=k<=max(0,n-1)) [we say that i is a doubledescent of a permutation p if p(i) > p(i+1) > p(i+2); we say that a permutation p has an initial descent if p(1) > p(2)].at n=41A162976