29835

Appears in sequences

• Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=7.at n=37A076673
• Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=10.at n=37A076675
• Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=11.at n=35A076676
• Odd infinitary abundant numbers.at n=19A127666
• Composites that are the sum of two, three, four and five consecutive composite numbers.at n=30A151745
• Number of binary words of length n with properties that there is no pair of adjacent 1's and no subword of the form X^4 for any string X.at n=28A170877
• Irregular triangle of odd primitive abundant numbers (A006038) in which row n has numbers with n distinct prime factors.at n=37A188439
• Numbers whose arithmetic derivatives are a permutation of their digits.at n=36A225902
• Number of partitions of n containing m(2) as a part, where m denotes multiplicity.at n=43A240487
• Number of nX2 integer arrays with each element equal to the number of horizontal, vertical, diagonal and antidiagonal neighbors exactly one smaller than itself.at n=8A266062
• T(n,k)=Number of nXk integer arrays with each element equal to the number of horizontal, vertical, diagonal and antidiagonal neighbors exactly one smaller than itself.at n=46A266067
• Numerator of partial sums of a Ramanujan series with value 2/(Gamma(3/4)^4), given in A277235.at n=2A278140
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 483", based on the 5-celled von Neumann neighborhood.at n=17A282492
• Odd bi-unitary abundant numbers: odd numbers k such that bsigma(k) > 2*k, where bsigma is the sum of the bi-unitary divisors function (A188999).at n=21A293186
• Numbers n=2*k-1 where Sum_{j=1..k} (-1)^(j+1) * d(2*j-1) achieves a new negative record, with d(n) = number of divisors of n (A000005).at n=21A318738
• Odd infinitary abundant numbers whose infinitary abundancy is closer to 2 than that of any smaller odd infinitary abundant number.at n=1A335055
• Triangular array read by rows: T(n,k) is the number of partial functions on [n] with exactly k connected components, n>=0, 0<=k<=n.at n=24A349950
• Triangle read by rows. T(n, k) = B(n, n - k + 1) where B(n, k) = k^n * BellPolynomial(n, -1/k) for k > 0, if k = 0 then B(n, k) = k^n.at n=21A350262
• Odd numbers k that are closer to being perfect than previous terms, and also satisfy the condition that phi(k) = phi(sigma(k)).at n=7A386419
• Numbers k such that k - sopfr(k) is a positive cube.at n=23A389889