86086

Appears in sequences

• a(1)=a(2)=1, a(n)=a(n-1)+a(n-2) if n is not congruent to 3, a(n)=a(n-1)+a(n/3) if n is congruent to 3.at n=30A078913
• Abundant numbers whose aliquot sequence is abundant, deficient, abundant, ..., etc.at n=17A234969
• Cyclops numbers with circular digits {0,6,8,9}.at n=40A274765