login

Draft edits for A279667

(Bold, blue-underlined text is an ; faded, red-underlined text is a deletion.)

This sequence contains draft edits but has not been submitted for review.
To submit the changes for review, click the button at the bottom.

Number of subparts (also number of odd divisors) of the smallest number k such that the symmetric representation of sigma(k) has n layers.
(history; published version)
Individual edits:
#34 by Max Alekseyev at Thu Jul 16 08:51:20 EDT 2026
DATA

1, 2, 4, 4, 6, 8, 8, 12, 12, 12, 16, 24, 24, 18, 32, 32, 24, 36, 24, 36, 32, 48, 36, 32, 48, 48, 48

EXTENSIONS

STATUS

approved

All edits since published version (omitting small deletions for readability):
NAME

Number of subparts (also number of odd divisors) of the smallest number k such that the symmetric representation of sigma(k) has n layers.

DATA

1, 2, 4, 4, 6, 8, 8, 12, 12, 12, 16, 24, 24, 18, 32, 32, 24, 36, 24, 36, 32, 48, 36, 32, 48, 48, 48

OFFSET

1,2

COMMENTS

In other words: number of subparts (also number of odd divisors) of the smallest number k such that the symmetric representation of sigma(k) has at least a part of width n.

Note that the number of subparts in the symmetric representation of sigma(n) equals A001227(n), the number of odd divisors of n.

For more information about the subparts and the layers see A279387.

FORMULA

a(n) = A001227(A250070(n)).

EXAMPLE

For n = 5 we have that 360 is the smallest number k whose symmetric representation of sigma(k) has parts of width 5. The structure has six subparts: [719, 237, 139, 71, 2, 2]. On the other hand, 360 has six odd divisors: {1, 3, 5, 9, 15, 45}, so a(5) = 6.

KEYWORD

nonn,more

AUTHOR

Omar E. Pol, Dec 16 2016

EXTENSIONS

STATUS

approved

Log in to edit this sequence.