A014257 - OEIS

The OEIS is supported by the many generous donors to the OEIS 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 60, we have over 367,000 sequences, and we’ve crossed 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A014257

Product of digits of 2^n.

1, 2, 4, 8, 6, 6, 24, 16, 60, 10, 0, 0, 0, 144, 576, 2016, 2700, 0, 384, 5120, 0, 0, 0, 0, 24696, 21600, 0, 18816, 691200, 0, 0, 1032192, 11757312, 27993600, 6096384, 39191040, 64012032, 15240960, 0, 387072000, 0, 0, 0, 0, 0, 0, 0, 0, 0, 125971200, 0, 4180377600, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,2`
	LINKS	`Table of n, a(n) for n=0..54.`
	MATHEMATICA	`Array[ Times @@ IntegerDigits[ 2^# ]&, 100 ]`
	PROG	`(PARI) a(n) = vecprod(digits(2^n)); \\ Michel Marcus, Nov 18 2019`
	CROSSREFS	`Cf. A000079, A007377.` `Sequence in context: A292808 A300813 A086354 * A247576 A339133 A246821` `Adjacent sequences: A014254 A014255 A014256 * A014258 A014259 A014260`
	KEYWORD	`nonn,base,easy`
	AUTHOR	`N. J. A. Sloane.`
	EXTENSIONS	`More terms from Michel Marcus, Nov 18 2019`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 20:29 EST 2023. Contains 367502 sequences. (Running on oeis4.)