login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A239657 Number of odd divisors of n minus the number of parts in the symmetric representation of sigma(n). 17
0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 2, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 3, 0, 0, 0, 0, 1, 2, 0, 0, 0, 1, 0, 3, 0, 0, 3, 0, 0, 1, 0, 0, 0, 0, 0, 3, 0, 1, 0, 0, 0, 3, 0, 0, 1, 0, 0, 3, 0, 0, 0, 1, 0, 2, 0, 0, 2, 0, 1, 2, 0, 1, 0, 0, 0, 3, 0, 0, 0, 1, 0, 5, 1, 0, 0, 0, 0, 1, 0, 0, 1, 2, 0, 2, 0, 1, 4, 0, 0, 3, 0, 1, 0, 1, 0, 2, 0, 0, 1, 0, 0, 3, 0, 0, 0, 0, 0, 5, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,18

COMMENTS

Observation: at least the indices of the first 42 positive elements coincide with A005279: 6, 12, 15, 18, 20, 24..., checked (by hand) up to n = 2^7.

For more information about the symmetric representation of sigma see A237270, A237591.

The first comment is true for the indices of all positive elements. Hence the indices of the zeros give A174905. - Omar E. Pol, Jan 06 2017

a(n) is the number of subparts minus the number of parts in the symmetric representation of sigma(n). For the definition of "subpart" see A279387. - Omar E. Pol, Sep 26 2018

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..5000 (computed from the b-file of A237271 provided by Michel Marcus)

FORMULA

a(n) = A001227(n) - A237271(n).

EXAMPLE

Illustration of the symmetric representation of sigma(15) = 24 in the third quadrant:

.      _

.     | |

.     | |

.     | |

.     | |

.     | |

.     | |

.     | |

.     |_|_ _ _

.    8      | |_ _

.           |_    |

.             |_  |_

.            8  |_ _|

.                   |

.                   |_ _ _ _ _ _ _ _

.                   |_ _ _ _ _ _ _ _|

.                 8

.

For n = 15 the divisors of 15 are 1, 3, 5, 15, so the number of odd divisors of 15 is equal to 4. On the other hand the parts of the symmetric representation of sigma(15) are [8, 8, 8], there are three parts, so a(15) = 4 - 3 = 1.

From Omar E. Pol, Sep 26 2018: (Start)

Also the number of odd divisors of 15 equals the number of partitions of 15 into consecutive parts and equals the number of subparts in the symmetric representation of sigma(15). Then we have that the number of subparts minus the number of parts is  4 - 3 = 1, so a(15) = 1.

.      _

.     | |

.     | |

.     | |

.     | |

.     | |

.     | |

.     | |

.     |_|_ _ _

.    8      | |_ _

.           |_ _  |

.          7  |_| |_

.            1  |_ _|

.                   |

.                   |_ _ _ _ _ _ _ _

.                   |_ _ _ _ _ _ _ _|

.                 8

.

The above diagram shows the symmetric representation of sigma(15) with its four subparts: [8, 7, 1, 8]. (End)

CROSSREFS

Cf. A000203, A005279, A174905, A196020, A236104, A235791, A237048, A237270, A237271, A237591, A237593, A245092, A262626, A279387, A279391, A262626, A286000, A286001, A296508.

Sequence in context: A219483 A239927 A069846 * A298934 A309061 A289618

Adjacent sequences:  A239654 A239655 A239656 * A239658 A239659 A239660

KEYWORD

nonn

AUTHOR

Omar E. Pol, Mar 23 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 8 14:52 EDT 2020. Contains 333314 sequences. (Running on oeis4.)