18559

Appears in sequences

• "Pascal sweep" for k=9: draw a horizontal line through the 1 at C(k,0) in Pascal's triangle; rotate this line and record the sum of the numbers on it (excluding the initial 1).at n=55A009540
• Pisot sequence T(3,5).at n=22A020745
• Pisot sequence T(5,8), a(n) = floor(a(n-1)^2/a(n-2)).at n=21A020749
• a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 3), t = A023531.at n=16A024313
• Fibonacci iteration starting with (1, a(n)) leads to a "nine digits anagram".at n=27A034587
• Expansion of 1/((1-x)*(1-x-x^3)).at n=24A077868
• a(n) = Sum_{k=0..floor(n/3)} C(n-2k,k-1).at n=29A099560
• List of different composites in Pascal-like triangles with index of asymmetry y = 2 and index of obliquity z = 0 or z = 1.at n=45A141066
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (0, 0, -1), (1, -1, 0), (1, 1, 1)}.at n=8A149668
• a(n) equals the least sum of the squares of the coefficients in (1 + 2*x^k + x^p + x^q)^n found at sufficiently large p and q>(n+1)p for some fixed k>0.at n=4A186377
• Number of partitions of n such that (greatest part) + (least part) < number of parts.at n=40A237822
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 313", based on the 5-celled von Neumann neighborhood.at n=29A271202
• a(n) = number of segments (edges) in the configuration A290447(n).at n=23A290866
• Number of integer partitions of n whose negated run-lengths are unimodal.at n=40A332638
• Setwise difference A340150 \ A340076.at n=40A340151
• Numbers k such that k and 4k, taken together, contain all digits 1 though 9 at least once.at n=29A346135