login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A273165 One half the number of divisors of nonprime numbers that are 3 (mod 4). 1
2, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 3, 2, 2, 2, 2, 4, 2, 3, 2, 2, 3, 3, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Row length numbers of A273164.

With the Jan 05 2004 Jovovic comment on A078703 a(n) is also the number of divisors +1 as well as -1 (mod 4) of A091236(n). See the example section of A273164.

LINKS

Table of n, a(n) for n=1..70.

FORMULA

a(n) = number of divisors of A091236(n)(nonprime numbers 3 (mod 4)).

CROSSREFS

Cf. A078703, A091236, A273164.

Sequence in context: A257071 A212300 A165074 * A095139 A109038 A208246

Adjacent sequences:  A273162 A273163 A273164 * A273166 A273167 A273168

KEYWORD

nonn,easy

AUTHOR

Wolfdieter Lang, Jul 29 2016

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 December 7 09:33 EST 2019. Contains 329843 sequences. (Running on oeis4.)