Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152435
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152435 a(n)=(11^n - 1)/(5*2^(3 - 2*Mod[n, 2])). +0
1
0, 1, 3, 133, 366, 16105, 44289, 1948717, 5358972, 235794769, 648435615, 28531167061, 78460709418, 3452271214393, 9493745839581, 417724816941565, 1148743246589304, 50544702849929377, 138997932837305787 (list; graph; listen)
OFFSET

0,3

MATHEMATICA

a[n_] := (11^n - 1)/(5*2^(3 - 2*Mod[n, 2]));

Table[a[n], {n, 0, 30}]

CROSSREFS

Sequence in context: A083999 A090540 A048796 this_sequence A157086 A051376 A101721

Adjacent sequences: A152432 A152433 A152434 this_sequence A152436 A152437 A152438

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Dec 04 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 | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research