

A051464


Number of divisors of 4*(2^n1) + 1.


1



2, 2, 2, 2, 4, 4, 2, 2, 4, 2, 4, 2, 4, 6, 4, 4, 16, 2, 4, 2, 4, 2, 4, 8, 12, 8, 2, 4, 8, 4, 4, 4, 4, 4, 4, 8, 8, 4, 8, 16, 8, 4, 8, 8, 6, 16, 8, 8, 8, 16, 8, 4, 32, 32, 8, 4, 8, 4, 4, 8, 16, 8, 8, 16, 48, 16, 16, 8, 4, 16, 4, 16, 16, 8, 8, 8, 16, 16, 8, 16, 32
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

Create a table with tau(2^n1) as the first row (A046801) and tau(m) as the first column (A000005). The second column is tau(A004760) and so on. Rows 2, 3 and 4 are easily described in terms of row 1. This sequence is row 5.


LINKS

Sean A. Irvine, Table of n, a(n) for n = 1..591


FORMULA

a(n) = tau(4*(2^n 1)+1), where d(n) = A000005(n).


MATHEMATICA

Array[DivisorSigma[0, 4*(2^#  1) + 1] &, 81] (* Michael De Vlieger, Sep 15 2021 *)


PROG

(PARI) a(n) = numdiv(4*(2^n1) + 1); \\ Michel Marcus, Sep 16 2021


CROSSREFS

Cf. A000005, A036563.
Sequence in context: A241514 A125913 A122386 * A151565 A060632 A160407
Adjacent sequences: A051461 A051462 A051463 * A051465 A051466 A051467


KEYWORD

nonn


AUTHOR

Edwin D. Evans, eevans2(AT)pacbell.net


EXTENSIONS

a(81) corrected by Sean A. Irvine, Sep 15 2021


STATUS

approved



