This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A216850 Number of distinct infinite sets of primes congruent to a subset of 1..n mod n. 1
 1, 2, 6, 6, 30, 12, 126, 30, 126, 60, 2046, 60, 8190, 252, 1020, 510, 131070, 252, 524286, 1020, 16380, 4092, 8388606, 1020, 2097150, 16380, 524286, 16380, 536870910, 2040, 2147483646, 131070, 4194300, 262140, 67108860 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Charles R Greathouse IV, Table of n, a(n) for n = 1..1000 FORMULA a(n) = (2^phi(n) - 1)*2^omega(n), where omega(n) is the number of distinct prime factors of n. EXAMPLE There are four subsets of {1, 2}: {1, 2}, {1}, {2}, and {}. There are only finitely many primes in {2} or {} mod 2, leaving primes congruent to {1} (the odd primes) and {1, 2} (all primes). Thus a(2) = 2. MATHEMATICA Table[(2^EulerPhi[n] - 1) 2^PrimeNu[n], {n, 40}] (* Alonso del Arte, Dec 10 2012 *) PROG (PARI) a(n)=(2^eulerphi(n)-1)*2^omega(n) \\ Charles R Greathouse IV, Dec 10 2012 CROSSREFS Sequence in context: A068629 A144361 A163641 * A070889 A072744 A056042 Adjacent sequences:  A216847 A216848 A216849 * A216851 A216852 A216853 KEYWORD nonn,easy AUTHOR Charles R Greathouse IV, Dec 10 2012 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.

Last modified December 10 12:30 EST 2019. Contains 329895 sequences. (Running on oeis4.)