Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100747
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100747 A modular recurrence. +0
2
1, 3, 15, 45, 225, 675, 3375, 10125, 50625, 151875, 759375, 2278125, 11390625, 34171875, 170859375, 512578125, 2562890625, 7688671875, 38443359375, 115330078125, 576650390625, 1729951171875, 8649755859375, 25949267578125 (list; graph; listen)
OFFSET

0,2

COMMENT

Interpolated zeros suppressed. The inverse mod 2 binomial transform of 2^n is 1,1,3,3,15,15,... (A100735).

FORMULA

a(0)=1, a(1)=0, a(n)=(5-2*mod(n/2, 2))a(n-2). a(n)=A101553(2(n+1))/5.

a(2n) = 15^n, a(2n+1) = 3 * 15^n. - Ralf Stephan, May 16 2007

O.g.f.: -(1+3*x)/(-1+15*x^2) . - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 04 2008

CROSSREFS

Sequence in context: A030505 A074355 A005560 this_sequence A100737 A110464 A088108

Adjacent sequences: A100744 A100745 A100746 this_sequence A100748 A100749 A100750

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Dec 06 2004

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 September 8 08:06 EDT 2008. Contains 143486 sequences.


AT&T Labs Research