Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130567
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130567 The number of involutions for group G_n for a(0)=2 instead of 1 or 5: G_n+1=G_n(Central Product) D_8. +0
1
2, 7, 23, 79, 287, 1087, 4223, 16639, 66047, 263167, 1050623, 4198399, 16785407, 67125247, 268468223, 1073807359, 4295098367, 17180131327, 68720001023, 274878955519, 1099513724927, 4398050705407, 17592194433023, 70368760954879 (list; graph; listen)
OFFSET

1,1

COMMENT

a(0)=1->A099393 a(0)=3 minus a(n)-3^(n+1)-> A028244

REFERENCES

A.M.Cohen and D.E. Taylor, American Math Monthly, volume 114,Number 7, Aug-Sept 2007, pages 633-638

FORMULA

a(n) = 2^(2*n - 1) + 2*a(n - 1) + 1

O.g.f.: x(2-7x+2x^2)/((1-x)(1-4x)(1-2x)). a(n)=A093069(n-2), n>1. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 13 2008

a(n)=-1+2*2^n+4^n, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jul 30 2008

MATHEMATICA

f[n_Integer?Positive] := f[n] = 2^(2*n - 1) + 2*f[n - 1] + 1; f[0] = 2; Table[f[n], {n, 0, 30}]

CROSSREFS

Cf. A099393, A028244.

Adjacent sequences: A130564 A130565 A130566 this_sequence A130568 A130569 A130570

Sequence in context: A068593 A112657 A007717 this_sequence A143629 A119371 A013516

KEYWORD

nonn

AUTHOR

Roger L Bagula (rlbagulatftn(AT)yahoo.com), Aug 09 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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research