id:A128212 - OEIS Search Results

Search: id:A128212

Displaying 1-1 of 1 results found.

page 1

a(n)=sum_digits(p), where p is the product of the digits of n.

+0
1

1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 2, 4, 6, 8, 1, 3, 5, 7, 9, 0, 3, 6, 9, 3, 6, 9, 3, 6, 9, 0, 4, 8, 3, 7, 2, 6, 10, 5, 9, 0, 5, 1, 6, 2, 7, 3, 8, 4, 9, 0, 6, 3, 9, 6, 3, 9, 6, 12, 9, 0, 7, 5, 3, 10, 8, 6, 13, 11, 9, 0, 8, 7, 6, 5, 4, 12, 11, 10, 9, 0, 9, 9, 9, 9, 9, 9, 9, 9, 9, 0 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`The sequence grows very slowly. For n<=10000 the maximal value is 27.`
	EXAMPLE	`a(73)=3 because 7*3=21 and 2+1=3`
	MAPLE	`P:=proc(n) local i, k, w; for i from 1 by 1 to n do w:=1; k:=i; while k>0 do w:=w(k-(trunc(k/10)10)); k:=trunc(k/10); od; k:=w; w:=0; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; print(w); od; end: P(100);`
	CROSSREFS	`Sequence in context: A062078 A031347 A087471 this_sequence A007954 A079475 A081286` `Adjacent sequences: A128209 A128210 A128211 this_sequence A128213 A128214 A128215`
	KEYWORD	`easy,nonn,base`
	AUTHOR	`Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), May 03 2007`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research