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

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A182593 Number of prime factors of form cn+1 for numbers 6^n-1 0
 2, 1, 2, 1, 3, 1, 1, 2, 3, 2, 3, 2, 3, 2, 3, 4, 3, 2, 3, 3, 3, 4, 3, 2, 5, 2, 4, 1, 4, 2, 3, 2, 6, 3, 5, 5, 4, 4, 3, 2, 4, 4, 4, 4, 6, 3, 5, 3, 4, 5, 6, 3, 5, 2, 5, 3, 4, 3, 7, 3, 3, 4, 4, 5, 6, 2, 4, 4, 8, 1, 7, 4, 8, 5, 4, 2, 9, 3, 5, 4, 5, 7, 4, 3, 5, 5, 4, 3, 6, 2, 6, 5, 4, 7, 8, 5, 6, 6, 7, 2, 11, 4, 7, 6, 7, 3, 6, 2, 6, 5, 6, 4, 6, 7, 4, 4, 4, 6, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS Table of n, a(n) for n=2..120. S. Mustonen, On prime factors of numbers m^n+-1 Seppo Mustonen, On prime factors of numbers m^n+-1 [Local copy] EXAMPLE For n=6, 6^n-1=46655=5*7*31*43 and has three prime factors of form cn+1, namely 7=n+1, 31=3n+1, 43=7n+1. Thus a(6)=3. MATHEMATICA m = 6; n = 2; nmax = 120; While[n <= nmax, {l = FactorInteger[m^n - 1]; s = 0; For[i = 1, i <= Length[l], i++, {p = l[[i, 1]]; If[IntegerQ[(p - 1)/n] == True, s = s + l[[i, 2]]]; }]; a[n] = s; } n++; ]; Table[a[n], {n, 2, nmax}] CROSSREFS Sequence in context: A321279 A294882 A048220 * A201167 A202853 A228572 Adjacent sequences: A182590 A182591 A182592 * A182594 A182595 A182596 KEYWORD nonn AUTHOR Seppo Mustonen, Nov 22 2010 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.

Last modified December 11 11:25 EST 2023. Contains 367724 sequences. (Running on oeis4.)