30008

Appears in sequences

• a(n) = floor(n*phi^15), where phi is the golden ratio, A001622.at n=22A004930
• a(n) = round(n*phi^15), where phi is the golden ratio, A001622.at n=22A004950
• a(n) = 1^2 + prime(1)^2 + prime(2)^2 + ... + prime(n)^2.at n=20A024525
• Numbers k such that the decimal part of k^(1/8) starts with a 'nine digits' anagram.at n=11A034283
• a(n) = (n-5)*(n-6)*(n-7)*(n-16)/24.at n=30A167543
• Number of partitions of n such that 2*(least part) < number of parts.at n=38A237758
• Number of partitions p of n such that (number of distinct parts of p) <= max(p) - min(p).at n=39A239955
• Number of partitions p of n such that (maximal multiplicity over the parts of p) = number of 1s in p.at n=42A241131
• Consider a number n with m decimal digits. The sequence lists the numbers n having the suffix of length m-1 in the middle of the decimal expansion of n^2.at n=40A242964
• Numbers that are values of the totient function (A002202) but not of the reduced totient function (A002174).at n=11A270265
• Numbers with digit sum 11 that are multiples of 11.at n=35A283742
• Number x = concat(MSD(x),b) such that MSD(x)*b = d(x), where MSD(x) is the Most Significant Digit of x and d(x) is the number of divisors of x.at n=10A291618
• a(n) = Sum_{d|n} sigma(d)^3.at n=24A344044