id:A130634 - OEIS Search Results

Search: id:A130634

Displaying 1-1 of 1 results found.

page 1

Additive persistence of double factorials.

+0
1

0, 0, 0, 0, 0, 1, 2, 1, 2, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 4, 3, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 3, 3, 4, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 3, 3, 3, 3 (list; graph; listen)

	OFFSET	`0,7`
	EXAMPLE	`10!! = 108642 = 3840 -> 3+8+4+0 = 15 -> 1+5 = 6 -> persistence = 2.`
	MAPLE	`P:=proc(n) local i, k, w, ok, cont; for i from 0 by 1 to n do k:=i; w:=i-2; while w>0 do k:=kw; w:=w-2; od; w:=0; ok:=1; if k<10 then print(0); else cont:=1; while ok=1 do while k>0 do w:=w+(k-(trunc(k/10)10)); k:=trunc(k/10); od; if w<10 then ok:=0; print(cont); else cont:=cont+1; k:=w; w:=1; fi; od; fi; od; end: P(100);`
	CROSSREFS	`Cf. A001147.` `Sequence in context: A115756 A067731 A147844 this_sequence A053735 A033667 A033923` `Adjacent sequences: A130631 A130632 A130633 this_sequence A130635 A130636 A130637`
	KEYWORD	`easy,nonn,base`
	AUTHOR	`Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Jun 19 2007, corrected Jun 22 2007`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research