Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A028894
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A028894 a(n) = either 4a(n-1)+1 or 4a(n-1)+3 depending on corresponding term of A005614, +1 for 0, +3 for 1. +0
3
1, 5, 23, 95, 381, 1527, 6109, 24439, 97759, 391037, 1564151, 6256607, 25026429, 100105719, 400422877, 1601691511, 6406766047, 25627064189, 102508256759, 410033027037, 1640132108151, 6560528432607, 26242113730429 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

f[1]={0}; f[2]={1}; f[n_] := f[n]=Join[f[n-1], f[n-2]]; a[1]=1; a[n_] := a[n]=4a[n-1]+1+2f[9][[n]]; a/@Range[1, 30]

CROSSREFS

Related to A005614, A002450, A037576, A066744.

Sequence in context: A034447 A121329 A146013 this_sequence A140529 A055489 A109765

Adjacent sequences: A028891 A028892 A028893 this_sequence A028895 A028896 A028897

KEYWORD

nonn

AUTHOR

John McNamara (mistermac39(AT)yahoo.com), Jan 12 2002

EXTENSIONS

Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jan 14, 2002

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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research