cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A077657 Least number with exactly n consecutive successors, all having the same number of prime factors (counted with multiplicity).

Original entry on oeis.org

1, 2, 33, 603, 602, 2522, 211673, 3405123, 3405122, 49799889, 202536181, 3195380868, 5208143601, 85843948321, 97524222465
Offset: 0

Views

Author

Reinhard Zumkeller, Nov 13 2002

Keywords

Comments

A001222(a(n))=A001222(a(n)+k) for k<=n;
A077655(a(n))=n and A077655(k)

Examples

			a(0)=A077656(1)=1; a(1)=A045920(1)=2; a(2)=A045939(1)=33; a(3)=A045940(2)=603; a(4)=A045941(1)=602; a(5)=A045942(1)=2522.
		

Crossrefs

Cf. A045984.

Formula

a(n)=A045984(n+1)+A077655(A045984(n+1))-n - Martin Fuller, Nov 21 2006

Extensions

More terms from Martin Fuller, Nov 21 2006

A077655 Number of consecutive successors of n having the same number of prime factors as n (counted with multiplicity).

Original entry on oeis.org

0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0
Offset: 1

Author

Reinhard Zumkeller, Nov 13 2002

Keywords

Comments

If a(n) > 0 then a(n+1) = a(n)-1.

Examples

			33=3*11 has only two successors also with two factors: 34=2*17 and 35=5*7 (whereas 33+3=36=2*2*3*3), therefore a(33)=2.
		

Programs

  • Mathematica
    snpf[n_]:=Module[{f=PrimeOmega[n],k=0},While[f==PrimeOmega[n+k],k++];k]; Array[snpf,110]-1 (* Harvey P. Dale, Aug 01 2021 *)
  • PARI
    A077655(n) = { my(k=n+1,w=bigomega(n)); while(bigomega(k)==w,k++); (k-n)-1; }; \\ Antti Karttunen, Jan 22 2020
Showing 1-2 of 2 results.