|
Search: id:A061419
|
|
|
| A061419 |
|
a(n) = ceiling[a(n-1)*3/2] with a(1) = 1. |
|
+0
17
|
|
| 1, 2, 3, 5, 8, 12, 18, 27, 41, 62, 93, 140, 210, 315, 473, 710, 1065, 1598, 2397, 3596, 5394, 8091, 12137, 18206, 27309, 40964, 61446, 92169, 138254, 207381, 311072, 466608, 699912, 1049868, 1574802, 2362203, 3543305, 5314958, 7972437, 11958656
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
It appears that this sequence is the (L)-sieve transform of {3,6,9,12,...,3n,...}=A008585. (See A152009 for the definition of the (L)-sieve transform.) [From John W. Layman (layman(AT)math.vt.edu), Jan 06 2009]
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,500
Eric Weisstein's World of Mathematics, Power Ceilings
|
|
FORMULA
|
a(n) = A061418(n)-1 = floor[K*(3/2)^n] where K = 1.08151366859...
The constant K is 2/3*K(3) (see A083286). - Ralf Stephan, May 29, 2003
a(1)=1, a(n)=A070885(n)/3. - Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 18 2002
a(n) = ceiling((a(n-1)+a(n-2))*9/10) - Frank Adams-Watters (FrankTAW(AT)Netscape.net), May 01 2006
|
|
EXAMPLE
|
a(6) = ceiling[8*3/2] = 12.
|
|
PROGRAM
|
(MAGMA) [ n eq 1 select 1 else Ceiling(Self(n-1)*3/2): n in [1..40] ]; [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Nov 14 2008]
(PARI) { a=2/3; for (n=1, 500, write("b061419.txt", n, " ", a=ceil(a*3/2)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 22 2009]
|
|
CROSSREFS
|
Cf. A002379, A034082, A061418, A061420, A003312.
First differences are in A073941.
Sequence in context: A109537 A081226 A156623 this_sequence A130732 A018135 A065435
Adjacent sequences: A061416 A061417 A061418 this_sequence A061420 A061421 A061422
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), May 02 2001
|
|
|
Search completed in 0.003 seconds
|
