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!)
A157928 a(n) = 0 if n < 2, = 1 otherwise. 5
0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
A characteristic function which indicates whether n has a prime factorization n = product p_i^e_i where p_i are primes (A000040) and e_i nonnegative exponents, at least one e_i nonzero.
a(n), n>=1, is also generated by the following Dirichlet convolutions:
a(n) = A157658(n) * A000012(n),
a(n) = A008683(n) * A032741(n).
a(n) appears as a factor in the following Dirichlet convolutions:
a(n) * A000010(n) = A051953(n),
a(n) * A000027(n) = A001065(n),
a(n) * A000012(n) = A032741(n).
a(n) is also both the number of disconnected 0-regular graphs on n vertices and the number of disconnected 1-regular graphs on 2n vertices. - Jason Kimberley, Sep 27 2011
Partial sums of A185012. - Jason Kimberley, Oct 15 2011
LINKS
FORMULA
a(n) = A057427(n - 1) for n >= 2.
MATHEMATICA
PadRight[{0, 0}, 120, {1}] (* Harvey P. Dale, Jun 03 2019 *)
CROSSREFS
Sequence in context: A189078 A257834 A173950 * A159075 A178333 A063524
KEYWORD
nonn,easy
AUTHOR
Jaroslav Krizek, Mar 09 2009
EXTENSIONS
Definition simplified by R. J. Mathar, May 17 2010
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 March 19 04:58 EDT 2024. Contains 370952 sequences. (Running on oeis4.)