login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243982 Number of divisors of n minus the number of parts in the symmetric representation of sigma(n). 3
0, 1, 0, 2, 0, 3, 0, 3, 0, 2, 0, 5, 0, 2, 1, 4, 0, 5, 0, 5, 0, 2, 0, 7, 0, 2, 0, 5, 0, 7, 0, 5, 0, 2, 1, 8, 0, 2, 0, 7, 0, 7, 0, 4, 3, 2, 0, 9, 0, 3, 0, 4, 0, 7, 0, 7, 0, 2, 0, 11, 0, 2, 1, 6, 0, 7, 0, 4, 0, 5, 0, 11, 0, 2, 2, 4, 1, 6, 0, 9, 0, 2, 0, 11, 0, 2, 0, 7, 0, 11, 1, 4, 0, 2, 0, 11, 0, 3, 1, 8, 0, 6, 0, 7 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
For more information see A237270.
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) = A000005(n) - A237271(n).
EXAMPLE
For n = 9 the divisors of 9 are [1, 3, 9] and the parts of the symmetric representation of sigma(9) are [5, 3, 5]. In both cases there are three elements, so a(9) = 3 - 3 = 0.
For n = 10 the four divisors of 10 are [1, 2, 5, 10] and the two parts of the symmetric representation of sigma(10) are [9, 9], so a(10) = 4 - 2 = 2.
MATHEMATICA
(* Function a237270[] is defined in A237270 *)
a243982[n_]:=Length[Divisors[n] - Length[a237270[n]]
a243982[m_, n_]:=Map[a243982, Range[m, n]]
a243982[1, 104]] (* data *)
(* Hartmut F. W. Hoft, Sep 19 2014 *)
CROSSREFS
Sequence in context: A298645 A243319 A189230 * A214000 A161123 A035442
KEYWORD
nonn
AUTHOR
Omar E. Pol, Jun 16 2014
EXTENSIONS
a(94)-a(95) corrected by Omar E. Pol, Jul 02 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 8 22:22 EDT 2024. Contains 375024 sequences. (Running on oeis4.)