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-3 of 3 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

A077656 Numbers having a different number of prime factors as their successors (counted with multiplicity).

Original entry on oeis.org

1, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 15, 16, 17, 18, 19, 20, 22, 23, 24, 26, 28, 29, 30, 31, 32, 35, 36, 37, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 76, 77, 78, 79, 80, 81, 82, 83
Offset: 1

Author

Reinhard Zumkeller, Nov 13 2002

Keywords

Comments

A077655(a(n))=0; A001222(a(n))<>A001222(a(n)+1).

Examples

			20=2*2*5 and 20+1=21=3*7: A001222(20)<>A001222(21), therefore 20 is a term (A077655(20)=0).
		

Crossrefs

Programs

A305234 Number of successors of n having the same value of A001221 as n.

Original entry on oeis.org

0, 3, 2, 1, 0, 0, 2, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 3, 2, 1, 0, 0, 2, 1, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 2, 1, 0, 0, 4, 3, 2, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 3, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 3, 2, 1
Offset: 1

Author

Felix Fröhlich, May 28 2018

Keywords

Examples

			For n = 2: 3, 4 and 5 have the same number of distinct prime divisors as 2, but 6 does not, so a(2) = 3.
		

Crossrefs

Programs

  • PARI
    a(n) = my(k=n+1, i=0); while(omega(k)==omega(n), i++; k++); i
Showing 1-3 of 3 results.