[go: up one dir, main page]

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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Search: a046467 -id:a046467
Displaying 1-1 of 1 result found. page 1
     Sort: relevance | references | number | modified | created      Format: long | short | data
A046460 Number of prime factors of concatenation of numbers from 1 up to n, with multiplicity. +10
10
0, 3, 2, 2, 3, 8, 2, 5, 4, 3, 6, 6, 3, 3, 3, 4, 5, 6, 6, 10, 8, 6, 4, 6, 5, 9, 8, 7, 4, 7, 3, 6, 6, 2, 8, 9, 4, 4, 6, 9, 5, 7, 4, 7, 10, 7, 5, 8, 6, 10, 3, 9, 8, 14, 5, 5, 6, 4, 4, 8, 3, 8, 5, 10, 6, 8, 3, 10, 7, 6, 6, 7, 3, 9, 6, 6, 5, 6, 6, 10, 6, 7, 6, 7, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Carlos Rivera, Puzzle 8. Primes by Listing, The Prime Puzzles & Problems Connection.
MATHEMATICA
Join[{1}, Table[PrimeOmega[FromDigits[Flatten[IntegerDigits[Range[i]]]]], {i, 2, 35}]] (* Jayanta Basu, Jun 02 2013 *)
PROG
(PARI) conc(n) = my(s=""); for(k=1, n, s=Str(s, k)); eval(s); \\ A007908
a(n) = bigomega(conc(n)); \\ Michel Marcus, Oct 16 2019
CROSSREFS
KEYWORD
nonn,hard,base
AUTHOR
Patrick De Geest, Aug 15 1998
EXTENSIONS
Offset 1 and a(1)=0 from Michel Marcus, Oct 16 2019
More terms from Sean A. Irvine, Apr 10 2021
STATUS
approved
page 1

Search completed in 0.005 seconds

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 21:34 EDT 2024. Contains 375518 sequences. (Running on oeis4.)