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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A264959 a(n) = A257851(n,n). 13
1, 9, 27, 80, 216, 448, 1296, 2816, 6400, 13312, 30720, 62208, 139264, 311296, 688128, 1474560, 2985984, 6029312, 12845056, 30408704, 65011712, 131072000, 264241152, 553648128, 1132462080, 2293235712, 4697620480, 9932111872, 20132659200, 41875931136, 88046829568 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

MATHEMATICA

a[n_] := a[n] = Reap[For[m = 1; k = 1, k <= n+1, If[PrimeOmega[m] - PrimeNu[m] == n, Sow[m]; k++]; m++]][[2, 1]] // Last;

Table[Print[n, " ", a[n]]; a[n], {n, 0, 20}] (* Jean-François Alcover, Oct 03 2021 *)

PROG

(Haskell)

a264959 n = a257851 n n

(PARI) a(n) = my(nb=0, k=1); until (nb == n+1, my(f=factor(k)); if (bigomega(f) - omega(f) == n, nb++); k++; ); k-1; \\ Michel Marcus, Feb 05 2022

CROSSREFS

Cf. A046660, A257851, A261256.

Sequence in context: A110205 A319085 A211531 * A053702 A036314 A215690

Adjacent sequences: A264956 A264957 A264958 * A264960 A264961 A264962

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Nov 29 2015

EXTENSIONS

a(21)-a(25) from Michel Marcus, Feb 05 2022

More terms from Jinyuan Wang, Feb 18 2022

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 November 30 19:14 EST 2022. Contains 358453 sequences. (Running on oeis4.)