The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A028891 Iterated product of digits of n is a Fibonacci number. 3
 1, 2, 3, 5, 8, 11, 12, 13, 15, 18, 21, 24, 26, 29, 31, 34, 35, 36, 37, 38, 42, 43, 46, 49, 51, 53, 57, 62, 63, 64, 66, 67, 73, 75, 76, 77, 79, 81, 83, 88, 92, 94, 97, 99, 111, 112, 113, 115, 118, 121, 124, 126, 129, 131, 134, 135, 136, 137, 138, 142, 143, 146, 149, 151 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Harvey P. Dale, Table of n, a(n) for n = 0..1000 EXAMPLE 149 -> 1*4*9 = 36 -> 3*6 = 18 -> 1*8 = 8 is a Fibonacci number. MATHEMATICA ipdfQ[n_]:=Module[{pd=NestWhile[Times@@IntegerDigits[#]&, n, #>9&]}, MemberQ[ {1, 2, 3, 5, 8}, pd]]; Select[Range[200], ipdfQ] (* Harvey P. Dale, Mar 10 2016 *) CROSSREFS Cf. A031347, A028890, A028841. Sequence in context: A063178 A280205 A276731 * A028890 A189716 A002480 Adjacent sequences:  A028888 A028889 A028890 * A028892 A028893 A028894 KEYWORD nonn,base AUTHOR EXTENSIONS Extended (and corrected) by Patrick De Geest, Jun 15 1999 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 3 15:00 EST 2021. Contains 349463 sequences. (Running on oeis4.)