[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A170856 a(0) = 0, a(1) = 1; a(2^i + j) = 2a(j) + 3a(j + 1) for 0 <= j < 2^i. 1
0, 1, 3, 11, 3, 11, 39, 31, 3, 11, 39, 31, 39, 139, 171, 71, 3, 11, 39, 31, 39, 139, 171, 71, 39, 139, 171, 179, 495, 791, 555, 151, 3, 11, 39, 31, 39, 139, 171, 71, 39, 139, 171, 179, 495, 791, 555, 151, 39, 139, 171, 179, 495, 791, 555, 259, 495, 791, 879, 1843, 3363, 3247 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
MAPLE
f:= proc(n) option remember; local j;
j:= n - 2^ilog2(n);
2*procname(j)+3*procname(j+1);
end proc:
f(0):= 0: f(1):= 1:
map(f, [$0..100]); # Robert Israel, Jun 12 2018
MATHEMATICA
f[n_] := f[n] = With[{j = n - 2^Floor@Log[2, n]}, 2 f[j] + 3 f[j+1]];
f[0] = 0; f[1] = 1;
f /@ Range[0, 100] (* Jean-François Alcover, Aug 31 2020, after Robert Israel *)
CROSSREFS
Sequence in context: A238683 A303114 A359990 * A176781 A349407 A306367
KEYWORD
nonn,look
AUTHOR
N. J. A. Sloane, Jan 02 2010
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 11:15 EDT 2024. Contains 375512 sequences. (Running on oeis4.)