cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A366655 Number of distinct prime divisors of 8^n + 1.

This page as a plain text file.
%I A366655 #11 Jan 09 2024 18:46:33
%S A366655 1,1,2,2,2,3,4,3,3,3,5,4,4,3,6,5,3,5,6,4,4,5,6,4,5,6,9,6,5,4,10,4,3,7,
%T A366655 9,10,6,6,8,5,6,6,10,5,7,9,8,6,7,6,12,9,5,5,10,10,8,6,8,7,8,3,9,10,4,
%U A366655 10,12,7,8,6,14,7,8,5,10,10,8,11,16,5,7,10
%N A366655 Number of distinct prime divisors of 8^n + 1.
%H A366655 Max Alekseyev, <a href="/A366655/b366655.txt">Table of n, a(n) for n = 0..502</a>
%F A366655 a(n) = omega(8^n+1) = A001221(A062395(n)).
%F A366655 a(n) = A046799(3*n). - _Max Alekseyev_, Jan 09 2024
%o A366655 (PARI) for(n = 0, 100, print1(omega(8^n + 1), ", "))
%Y A366655 Cf. A062395, A001221, A057936, A274905, A366651, A366632, A366656, A366657, A366658, A366671.
%Y A366655 Cf. A046799, A366580, A366605, A366615, A366627, A366636, A366664, A119704, A366686, A366712.
%K A366655 nonn
%O A366655 0,3
%A A366655 _Sean A. Irvine_, Oct 15 2023