login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 2

%I #9 Jun 24 2014 01:08:11

%S 1,5,23,95,381,1527,6109,24439,97759,391037,1564151,6256607,25026429,

%T 100105719,400422877,1601691511,6406766047,25627064189,102508256759,

%U 410033027037,1640132108151,6560528432607,26242113730429

%N a(n) = either 4a(n-1)+1 or 4a(n-1)+3 depending on corresponding term of A005614, +1 for 0, +3 for 1.

%t 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]

%Y Related to A005614, A002450, A037576, A066744.

%K nonn

%O 1,2

%A _John McNamara_, Jan 12 2002

%E Edited by _Dean Hickerson_, Jan 14, 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 16:52 EDT 2024. Contains 371794 sequences. (Running on oeis4.)