|
Search: id:A110428
|
|
|
| A110428 |
|
a(1) =1, a(2) = 2,Subsequent term are generated like this, if a(m) is the last term available say a(2), then a(m+1) = a(m)*a(m-1),a(m+2) =a(m)*a(m-1)*a(m-2), ...a(2m-1) = a(m)*a(m-1)*a(m-2) ...(a(2)a(1). a(2m) = a(2m-1)*a(2m-2) and so on. |
|
+0
2
|
|
| 1, 2, 2, 4, 4, 16, 32, 64, 64, 4096, 131072, 2097152, 8388608, 33554432, 67108864, 134217728, 134217728, 18014398509481984, 1208925819614629174706176, 40564819207303340847894502572032, 340282366920938463463374607431768211456
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
By choosing appropriate a(1) and a(2) many such sequences can be generated.
|
|
EXAMPLE
|
a(3)= a(2)*a(1) = 2,a(4) = a(3)*a(2) = 4,a(5)=a(3)*a(2)*a(1) = 4,
a(6) = a(5)*a(4) = 16,...
|
|
CROSSREFS
|
Sequence in context: A112869 A086117 A095240 this_sequence A076928 A025557 A059372
Adjacent sequences: A110425 A110426 A110427 this_sequence A110429 A110430 A110431
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 01 2005
|
|
EXTENSIONS
|
More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 10 2006
|
|
|
Search completed in 0.002 seconds
|
