19526

Appears in sequences

• The minimal number which has multiplicative persistence 7 in base n.at n=6A064871
• a(n) = n^3 + 6*n^2 + 6*n + 1.at n=25A090197
• Numbers of the form q-p, where p and q are prime and q = p^0+p^1+p^2+..+p^k for some k.at n=16A166388
• Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^2+x^2+y^2>2n.at n=27A211644
• a(1)=1, a(2)=2; thereafter a(n) = a(n-1) + a(n-1-(number of even terms so far)) + a(n-1-(number of odd terms so far)).at n=43A249039
• Smallest index k such that Fibonacci(k) contains Fibonacci(n) as a proper substring in decimal notation.at n=37A263400
• Numbers k such that (25*10^k + 59)/3 is prime.at n=25A273726
• Let v = list of denominators of Farey series of order n (see A006843); a(n) = sum of products of adjacent terms of v.at n=18A278046
• Sum of the even parts in the partitions of n into 5 parts.at n=39A309547
• Smallest number with multiplicative persistence n in base 15.at n=7A320721
• Number of integer partitions of n such that every pair of distinct parts has a different quotient.at n=40A325853
• Number of entries in the eighth cycles of all permutations of [n] when cycles are ordered by decreasing lengths.at n=3A332857
• a(1) = 1. For n >= 2, add to a(n-1) its prime or nonprime index to obtain a(n).at n=21A355975
• Number of edges among all distinct circles that can be constructed from n equally spaced points along a line using only a compass.at n=13A359254
• G.f. satisfies A(x) = ( 1 + x*A(x)^3 / (1 - x*A(x)) )^2.at n=5A371582
• A382168 with duplicates removed.at n=35A382169