login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A116504
Number of distinct prime divisors of the concatenation of n,...,1.
18
0, 2, 2, 2, 3, 2, 2, 3, 3, 3, 2, 3, 3, 4, 5, 4, 6, 8, 4, 5, 4, 5, 4, 5, 6, 7, 5, 5, 7, 8, 3, 6, 5, 7, 8, 6, 4, 3, 6, 5, 8, 6, 3, 7, 6, 5, 7, 7, 3, 6, 3, 7, 9, 9, 3, 4, 4, 6, 3, 3, 5, 8, 5, 6, 7, 7, 4, 8, 8, 4, 8, 4, 7, 8, 10, 3, 7, 6, 4, 7, 7, 1, 3, 8, 3, 8, 5, 4, 5, 7, 11, 9, 6
OFFSET
1,2
LINKS
EXAMPLE
87654321 = 3*3*1997*4877, distinct prime divisors are 3, 1997 and 4877, hence a(8) = 3.
MATHEMATICA
b = {}; a = {}; Do[w = RealDigits[n]; w = First[w]; Do[PrependTo[a, w[[Length[w] - k + 1]]], {k, 1, Length[w]}]; p = FromDigits[a]; m = FactorInteger[p]; AppendTo[b, Length[m]], {n, 1, 30}]; b (* Artur Jasinski, Mar 30 2008 *)
Table[PrimeNu[FromDigits[Flatten[IntegerDigits/@Range[n, 1, -1]]]], {n, 95}] (* Harvey P. Dale, Oct 03 2015 *)
PROG
(PARI) {a=""; for(n=1, 58, a=concat(n, a); print1(omega(eval(a)), ", "))}
KEYWORD
nonn,base
AUTHOR
Parthasarathy Nambi, Mar 20 2006
EXTENSIONS
Edited and extended by Klaus Brockhaus, Mar 29 2006
Terms a(59)-a(93) from Sean A. Irvine, Nov 04 2009
a(90) corrected by Sean A. Irvine, Nov 02 2024
STATUS
approved