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.

A039649 a(n) = phi(n)+1.

Original entry on oeis.org

2, 2, 3, 3, 5, 3, 7, 5, 7, 5, 11, 5, 13, 7, 9, 9, 17, 7, 19, 9, 13, 11, 23, 9, 21, 13, 19, 13, 29, 9, 31, 17, 21, 17, 25, 13, 37, 19, 25, 17, 41, 13, 43, 21, 25, 23, 47, 17, 43, 21, 33, 25, 53, 19, 41, 25, 37, 29, 59, 17, 61, 31, 37, 33, 49, 21, 67, 33, 45, 25, 71, 25, 73, 37, 41
Offset: 1

Views

Author

Keywords

Comments

a(p) = p for p prime.
Records give A000040. - Omar E. Pol, Jul 10 2014
Which n are divisible by phi(n)+1? See A085118 for a possible answer and references. - Peter Munn, Jun 03 2021

Crossrefs

Programs

Formula

a(n) = A000010(n) + 1.
a(n) <= n for n > 1.
G.f.: x/(1 - x) + Sum_{k>=1} mu(k)*x^k/(1 - x^k)^2. - Ilya Gutkovskiy, Mar 16 2017

Extensions

Edited by Charles R Greathouse IV, Mar 18 2010.

A176175 Numbers k such that (2^(k-1) mod k) = number of prime divisors of k (counted with multiplicity).

Original entry on oeis.org

1, 3, 5, 6, 7, 10, 11, 13, 14, 17, 19, 22, 23, 26, 29, 31, 34, 37, 38, 41, 43, 46, 47, 53, 58, 59, 61, 62, 67, 71, 73, 74, 79, 82, 83, 86, 89, 94, 97, 101, 103, 106, 107, 109, 113, 118, 122, 127, 131, 134, 137, 139, 142, 146, 149, 151, 157, 158, 163, 166, 167, 173, 178, 179, 181, 191, 193, 194, 197, 199, 202, 206, 211, 214, 218, 223, 226, 227, 229, 233, 239, 241, 251, 254
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Dec 07 2010

Keywords

Comments

How is this related to A085118? - R. J. Mathar, Jul 02 2025

Crossrefs

Programs

  • Maple
    for n from 1 to 180 do modp(2^(n-1),n) ;  if % = numtheory[bigomega](n) then printf("%d,",n) ; end if; end do: # R. J. Mathar, Dec 07 2010
  • Mathematica
    Select[Range[254], PrimeOmega[#] == PowerMod[2, # - 1, #] &] (* Michael De Vlieger, Jul 02 2025 *)

Formula

{k: A001222(k) = A062173(k)}.
Showing 1-2 of 2 results.