231840

Appears in sequences

• Fibonacci sequence beginning 0, 5.at n=24A022088
• Triangle T(n,k) = k! * Stirling1(n,k), 1<=k<=n.at n=33A048594
• Expansion of e.g.f.: (log(1-x))^6.at n=8A052779
• Expansion of e.g.f. log((-1+x)/(-1+x+x^2)).at n=8A052832
• Layer counting sequence for hyperbolic tessellation by regular pentagons of angle Pi/2.at n=12A054888
• Exponential transform of Pascal's triangle A007318.at n=39A055883
• Exponential transform of Pascal's triangle A007318.at n=41A055883
• Coefficients of certain polynomials (rising powers).at n=30A075181
• Numbers that can be expressed as the difference of the squares of primes in exactly ten distinct ways.at n=17A092006
• Ordered forests of k increasing unordered trees on the vertex set {1,2,...,n} in which all outdegrees are <= 2.at n=33A185421
• T(n,k) = Number of n-turn rook's tours on a k X k board summed over all starting positions.at n=49A187189
• Number of 5-turn rook's tours on an n X n board summed over all starting positions.at n=5A187192
• y-values in the solution to 5*x^2 - 20 = y^2.at n=12A201157
• a(n) = 3*a(n-2) - a(n-4), a(0)=0, a(1)=1, a(2)=5, a(3)=4.at n=24A203976
• Averages y of twin prime pairs that satisfy y = x^2 + x - 2.at n=25A214840
• Triangle read by rows, the ordered Stirling cycle numbers, T(n, k) = k!* s(n, k); n >= 0 k >= 0.at n=42A225479
• GCD of all sums of n consecutive Lucas numbers.at n=47A229339
• Consider numbers n = concat(x,y,z) such that the product x*y*z | n. Leading zeros in y and z allowed. Sequence lists numbers that admit different concatenations.at n=29A256518