8589344768

Appears in sequences

• a(n) = 2^(2n+3) - 2^n*(n+3).at n=16A008464
• Numbers k such that sigma(k) == 8 (mod k).at n=28A045770
• Numbers k whose abundance is 8: sigma(k) - 2*k = 8.at n=24A088833
• Numbers m with divisor 8 | m and abundance sigma(m)-2*m = 8.at n=14A181598
• Numbers of the form 2^(t-1)*(2^t-9), where 2^t-9 is prime.at n=4A181705
• Numbers k such that sigma(k) == 0 (mod k+4).at n=29A274553
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 369", based on the 5-celled von Neumann neighborhood.at n=32A287859
• Number of separable multisets of size n covering an initial interval of positive integers.at n=34A336103
• Number of multisets of size n that have an alternating permutation and cover an initial interval of positive integers.at n=34A349055
• a(n) is the smallest Fibonacci n-step number with exactly n prime factors (counted with multiplicity).at n=15A359880
• Number of compositions (ordered partitions) of n into parts not greater than n/2.at n=34A368484