Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141267
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141267 Concatenate first n double factorials in reverse order. +0
3
1, 21, 321, 8321, 158321, 48158321, 10548158321, 38410548158321, 94538410548158321, 384094538410548158321, 10395384094538410548158321, 4608010395384094538410548158321, 1351354608010395384094538410548158321 (list; graph; listen)
OFFSET

0,2

COMMENT

Suggested by Smarandache's Concatenated Sequences.

FORMULA

a(n)=n!!*10^floor{1+log10[a(n-1)]}+a(n-1), with a(1)=1

MAPLE

P:=proc(i) local a, j, k, n; a:=1; print(1); for n from 2 by 1 to i do k:=n; j:=n-2; while j>0 do k:=k*j; j:=j-2; od; a:=k*10^floor(evalf(1+log10(a), 1000))+a; print(a); od; end: P(20);

CROSSREFS

Cf. A045508, A141265, A141266.

Sequence in context: A060554 A057610 A036737 this_sequence A016262 A001233 A145148

Adjacent sequences: A141264 A141265 A141266 this_sequence A141268 A141269 A141270

KEYWORD

nonn,base

AUTHOR

Paolo P. Lava (ppl(AT)spl.at), Jun 20 2008

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 | The OEIS Foundation | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified March 20 09:10 EDT 2010. Contains 173642 sequences.


AT&T Labs Research