cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A046515 Numbers with multiplicative persistence value 6.

Original entry on oeis.org

6788, 6878, 6887, 7688, 7868, 7886, 8678, 8687, 8768, 8786, 8867, 8876, 16788, 16878, 16887, 17688, 17868, 17886, 18678, 18687, 18768, 18786, 18867, 18876, 23788, 23878, 23887, 24678, 24687, 24768, 24786, 24867, 24876, 26478, 26487
Offset: 1

Views

Author

Patrick De Geest, Sep 15 1998

Keywords

Examples

			6788 -> [ 2688 ][ 768 ][ 336 ][ 54 ][ 20 ][ 0 ] -> one digit in six steps.
		

Crossrefs

Programs

  • Maple
    mp:= proc(n) option remember;
        if n <= 9 then return 0 fi;
        1+procname(convert(convert(n,base,10),`*`))
    end proc:
    select(mp=6, [$1..30000]); # Robert Israel, Feb 12 2019

Extensions

Offset corrected by Robert Israel, Feb 12 2019

A199996 Composite numbers whose multiplicative persistence is 6.

Original entry on oeis.org

6788, 6878, 6887, 7688, 7868, 7886, 8678, 8687, 8768, 8786, 8876, 16788, 16878, 16887, 17688, 17868, 17886, 18678, 18687, 18768, 18786, 18867, 18876, 23788, 23878, 24678, 24687, 24768, 24786, 24867, 24876, 26478, 26487, 26748, 26784, 26847, 26874, 27388
Offset: 1

Views

Author

Jaroslav Krizek, Nov 13 2011

Keywords

Comments

Complement of A046506 with respect to A046515.

Examples

			6788 -> [ 2688 ][ 768 ][ 336 ][ 54 ][ 20 ][ 0 ] -> one digit in six steps.
		

Crossrefs

Cf. A046506 (primes whose multiplicative persistence is 6).

Programs

  • Mathematica
    persistence[n_] := Module[{cnt = 0, k = n}, While[k > 9, cnt++; k = Times @@ IntegerDigits[k]]; cnt]; Select[Range[30000], ! PrimeQ[#] && persistence[#] == 6 &] (* T. D. Noe, Nov 23 2011 *)
Showing 1-2 of 2 results.