login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079450 a(n)=2^(n-1)*u(n) where u(1)=1 and u(n)=frac(3/2*u(n-1))+1. 0
1, 3, 5, 15, 29, 55, 101, 175, 269, 807, 1397, 2143, 6429, 11095, 16901, 50703, 86573, 259719, 517013, 1026751, 2031677, 3997879, 7799333, 15009391, 28250957, 51198439, 86486453, 259459359, 509942621, 992956951, 1905129029, 3567903439 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..32.

FORMULA

a(n+1)<=3*a(n). Conjecture : a(n+1)=3*a(n) if and only if n is a greedy power of (2/3) (i.e. n is in A077468)

CROSSREFS

Sequence in context: A051044 A003536 A118173 * A166956 A048738 A018454

Adjacent sequences:  A079447 A079448 A079449 * A079451 A079452 A079453

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Jan 13 2003

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 11 00:29 EST 2016. Contains 279033 sequences.