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!)
A198377 Smallest nonprime number with multiplicative persistence n. 0

%I #9 Mar 30 2012 19:00:25

%S 0,10,25,39,77,679,6788,68889,2677889,26888999,3778889989,

%T 277777788888899

%N Smallest nonprime number with multiplicative persistence n.

%C Probably finite sequence. The multiplicative persistence of a number is the number of times you need to multiply the digits together before reaching a single digit.

%e For n=4, a(4) = 39 because 39 is the smallest nonprime number with multiplicative persistence 3: 39 -> 27 -> 14 -> 4.

%Y Cf. A046500 (smallest prime with multiplicative persistence n).

%K nonn,base

%O 0,2

%A _Jaroslav Krizek_, Oct 23 2011

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 April 25 13:43 EDT 2024. Contains 371972 sequences. (Running on oeis4.)