Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131954
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131954 a(n) = sum of digits of (n! + a(n-1)). +0
5
1, 3, 9, 6, 9, 18, 18, 18, 36, 36, 45, 36, 36, 54, 54, 72, 72, 63, 54, 63, 72, 81, 108, 90, 81, 90, 117, 99, 144, 126, 144, 117, 153, 153, 153, 180, 162, 117, 198, 207, 153, 198, 198, 234, 216, 225, 234, 243, 234, 225, 207, 288, 297, 279, 297, 351, 279, 306, 333, 297 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n)=Sum_digits(n!+a(n-1))

EXAMPLE

a(4)=9+4!=9+24=33 -> Sum_digits(33)=6

MAPLE

P:=proc(n) local a, i, k, w; a:=0; for i from 1 by 1 to n do w:=0; k:=a+i!; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; a:=w; print(a); od; end: P(100);

CROSSREFS

Cf. A055263, A131955.

Sequence in context: A020834 A021720 A021256 this_sequence A134693 A096948 A016676

Adjacent sequences: A131951 A131952 A131953 this_sequence A131955 A131956 A131957

KEYWORD

easy,nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Jul 31 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research