Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
A361735
Modified semi-Padovan sequence: a(2*n) = a(n) and a(2*n+1) = a(2*n-1) + a(2*n-2), with a(0) = 0 and a(1) = 1.
3
0, 1, 1, 1, 1, 2, 1, 3, 1, 4, 2, 5, 1, 7, 3, 8, 1, 11, 4, 12, 2, 16, 5, 18, 1, 23, 7, 24, 3, 31, 8, 34, 1, 42, 11, 43, 4, 54, 12, 58, 2, 70, 16, 72, 5, 88, 18, 93, 1, 111, 23, 112, 7, 135, 24, 142, 3, 166, 31, 169, 8, 200, 34, 208, 1, 242, 42, 243, 11, 285, 43
OFFSET
0,6
LINKS
Cristina Ballantine and George Beck, Partitions enumerated by self-similar sequences, arXiv:2303.11493 [math.CO], 2023. See pp. 13-14.
MAPLE
a:= proc(n) option remember; `if`(n<2, n,
`if`(n::even, a(n/2), a(n-2)+a(n-3)))
end:
seq(a(n), n=0..70); # Alois P. Heinz, Mar 22 2023
PROG
(PARI) a(n) = if (n <= 1, return(n)); if (n%2, a(n-2) + a(n-3), a(n/2));
CROSSREFS
Sequence in context: A055440 A250028 A101279 * A064576 A322390 A113308
KEYWORD
nonn
AUTHOR
Michel Marcus, Mar 22 2023
STATUS
approved