Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102239
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102239 a(n) = Sum[5^i, {i, 0, n}] + 1 - Mod[Sum[5^i, {i, 0, n}], 2] +0
1
1, 7, 31, 157, 781, 3907, 19531, 97657, 488281, 2441407, 12207031, 61035157, 305175781, 1525878907, 7629394531, 38146972657, 190734863281, 953674316407, 4768371582031, 23841857910157, 119209289550781, 596046447753907 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = 4*a(n-1) + 5*a(n-2) - 2 (conjecture) - Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Apr 13 2005

(1/4) [5^(n+1) - 2(-1)^2 + 1 ]. - Ralf Stephan, May 17 2007

MATHEMATICA

a = Table[Sum[5^i, {i, 0, n}] + 1 - Mod[Sum[5^i, {i, 0, n}], 2], {n, 0, 50}]

PROGRAM

Floretion Algebra Multiplication Program, FAMP Code: 1tesseq[ + 'ij' + 'ik' + 'ji' + 'jk' + 'ki' + 'kj' + e]

CROSSREFS

Cf. A015531.

Sequence in context: A121517 A057620 A055625 this_sequence A139151 A139060 A060015

Adjacent sequences: A102236 A102237 A102238 this_sequence A102240 A102241 A102242

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Mar 15 2005

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 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research