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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087009 Least m such that omega(m) + Omega(m) = n, or 0 if no such m exists. 6
1, 0, 2, 4, 6, 12, 24, 48, 96, 192, 384, 768, 1536, 3072, 6144, 12288, 24576, 49152, 98304, 196608, 393216, 786432, 1572864, 3145728, 6291456, 12582912, 25165824, 50331648, 100663296, 201326592, 402653184, 805306368, 1610612736, 3221225472 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..33.

Index entries for linear recurrences with constant coefficients, signature (2).

FORMULA

For n>3, a(n)=2^(n-3)*3. - Ray Chandler, Nov 01 2003

a(n)=A058764(n-2). - From Philippe Deléham, Oct 17 2011.

G.f.: (2*x^4-2*x^2+2*x-1)/(2*x-1). [Colin Barker, Oct 23 2012]

PROG

(PARI) a(n) = {m = 1; while (omega(m) + bigomega(m) != n, m++); m} \\ Michel Marcus, Oct 23 2013

CROSSREFS

First occurrence of n in A080256.

Sequence in context: A095849 A094783 A058764 * A168263 A162936 A036484

Adjacent sequences:  A087006 A087007 A087008 * A087010 A087011 A087012

KEYWORD

nonn,easy

AUTHOR

Lekraj Beedassy, Oct 13 2003

EXTENSIONS

Corrected and extended by Ray Chandler, Nov 01 2003

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 November 13 12:45 EST 2019. Contains 329094 sequences. (Running on oeis4.)