Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123144
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123144 a(n) = if mod[n, 3] - 1 == 0 then a(n - 1) else n*a(n - 1). +0
1
1, 2, 6, 6, 30, 180, 180, 1440, 12960, 12960, 142560, 1710720, 1710720, 23950080, 359251200, 359251200, 6107270400, 109930867200, 109930867200, 2198617344000 (list; graph; listen)
OFFSET

1,2

COMMENT

Without duplicates this sequence is {1, 2, 8, 48, 384, 3840, 46080, 645120, ...}

MATHEMATICA

f[1]=1; f[n_] := f[n] = If[Mod[n, 3] - 1 == 0, f[n - 1], n*f[n - 1]] a = Table[f[n], {n, 1, 20}]

CROSSREFS

Cf. A007559.

Sequence in context: A093364 A113461 A061558 this_sequence A069260 A056603 A019198

Adjacent sequences: A123141 A123142 A123143 this_sequence A123145 A123146 A123147

KEYWORD

nonn

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Oct 01 2006

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Oct 04 2006

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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research