Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152438
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152438 a(n)=(19^n - 1)/(9*2^(3 - 2*Mod[n, 2])). +0
1
0, 1, 5, 381, 1810, 137561, 653415, 49659541, 235882820, 17927094321, 85153698025, 6471681049901, 30740484987030, 2336276859014281, 11097315080317835, 843395946104155461, 4006130743994738440 (list; graph; listen)
OFFSET

0,3

MATHEMATICA

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

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

CROSSREFS

Sequence in context: A098038 A072172 A100474 this_sequence A060506 A057633 A006700

Adjacent sequences: A152435 A152436 A152437 this_sequence A152439 A152440 A152441

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