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.

A367009 Number of divisors of n*2^n + 1.

This page as a plain text file.
%I A367009 #10 Jan 06 2024 06:06:19
%S A367009 1,2,3,3,4,4,8,8,4,4,12,4,8,6,8,8,4,12,16,16,16,4,16,16,16,16,24,16,6,
%T A367009 8,48,48,8,4,32,4,12,8,12,8,8,16,16,32,16,16,32,32,16,10,64,8,64,8,32,
%U A367009 16,12,32,32,16,16,128,8,8,96,32,256,24,16,32,32,48
%N A367009 Number of divisors of n*2^n + 1.
%C A367009 The numbers n*2^n+1 are called Cullen numbers.
%H A367009 Amiram Eldar, <a href="/A367009/b367009.txt">Table of n, a(n) for n = 0..865</a>
%F A367009 a(n) = sigma0(n*2^n + 1) = A000005(A002064(n)).
%t A367009 Table[DivisorSigma[0, n*2^n + 1], {n, 0, 100}] (* _Amiram Eldar_, Jan 06 2024 *)
%o A367009 (PARI) a(n) = numdiv(n*2^n + 1); \\ _Amiram Eldar_, Jan 06 2024
%Y A367009 Cf. A002064, A000005, A366898, A367007, A367008.
%K A367009 nonn
%O A367009 0,2
%A A367009 _Sean A. Irvine_, Oct 31 2023