|
Search: id:A119795
|
|
|
| A119795 |
|
a(1) = a(2) = 1. a(n) = a(n-2) + (largest power of 2 dividing a(n-1)). |
|
+0
1
|
|
| 1, 1, 2, 3, 3, 4, 7, 5, 8, 13, 9, 14, 11, 15, 12, 19, 13, 20, 17, 21, 18, 23, 19, 24, 27, 25, 28, 29, 29, 30, 31, 31, 32, 63, 33, 64, 97, 65, 98, 67, 99, 68, 103, 69, 104, 77, 105, 78, 107, 79, 108, 83, 109, 84, 113, 85, 114, 87, 115, 88, 123, 89, 124, 93, 125, 94, 127, 95, 128
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
4 is the largest power of two dividing a(18) = 20. So a(19) = a(17) + 4 = 17.
|
|
MAPLE
|
A006519 := proc(n::integer) RETURN(gcd(2^n, n)) ; end; A119795 := proc(nmax::integer) local a, n; a := array(1..nmax) ; a[1] := 1 ; a[2] := 1 ; for n from 3 to nmax do a[n] := a[n-2]+A006519(a[n-1]) ; end ; RETURN(a) ; end ; nmax := 200 ; a := A119795(nmax) ; for n from 1 to nmax do printf("%d, ", a[n]) ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 04 2006
|
|
CROSSREFS
|
Cf. A006519.
Sequence in context: A078467 A154217 A049790 this_sequence A119614 A035540 A114863
Adjacent sequences: A119792 A119793 A119794 this_sequence A119796 A119797 A119798
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Jul 30 2006
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 04 2006
|
|
|
Search completed in 0.002 seconds
|
