A372556 -id:A372556 - cp's OEIS frontend

A372558 Numbers k such that A130249(k) differs from A372556(k).

63, 84, 191, 212, 255, 276, 297, 340, 703, 724, 767, 788, 809, 852, 937, 1022, 1023, 1044, 1065, 1108, 1129, 1150, 1193, 1278, 1363, 1364, 2751, 2772, 2815, 2836, 2857, 2900, 2985, 3070, 3071, 3092, 3113, 3156, 3177, 3198, 3241, 3326, 3411, 3412, 3497, 3582, 3667, 3752, 3753, 3838, 3923, 4008, 4093, 4094, 4095

Offset: 1

Antti Karttunen, May 07 2024

nonn

			From the terms of A372557 both 63 and 84 are included here, because the largest summand in their non-greedy solutions is different from the largest summand in their greedy solutions, while 169 is NOT included because the largest summand in both cases is 85. See examples in A372557.

Antti Karttunen, Table of n, a(n) for n = 1..24118

Cf. A001045, A130249, A372555, A372556.

Subsequence of A372557.

A130249(n) = (#binary(3*n+1)-1);
isA372558(k) = (A372556(k)!=A130249(k)); \\ Uses also the program from A372556.

A372555 Least number of Jacobsthal numbers that add up to n.

Original entry on oeis.org

0, 1, 2, 1, 2, 1, 2, 3, 2, 3, 2, 1, 2, 3, 2, 3, 2, 3, 4, 3, 4, 1, 2, 3, 2, 3, 2, 3, 4, 3, 4, 3, 2, 3, 4, 3, 4, 3, 4, 5, 4, 5, 2, 1, 2, 3, 2, 3, 2, 3, 4, 3, 4, 3, 2, 3, 4, 3, 4, 3, 4, 5, 4, 3, 2, 3, 4, 3, 4, 3, 4, 5, 4, 5, 4, 3, 4, 5, 4, 5, 4, 5, 6, 5, 4, 1, 2, 3, 2, 3, 2, 3, 4, 3, 4, 3, 2, 3, 4, 3, 4, 3, 4, 5, 4, 5, 2

Offset: 0

Antti Karttunen, May 07 2024

nonn

Differs from A265745 for the first time at n=63, where a(63) = 3, while A265745(63) = 5. The next differences occur at n=84, 148, 169, 191, 212, 234, 255, etc. See A372557.

See conjecture in A372556, and also in A372561.

			a(5) = 1, because 5 is itself in A001045.
a(7) = 3, because 7 can be expressed as a sum of three Jacobsthal numbers, either as 5+1+1 or 3+3+1, but not as a sum of two Jacobsthal numbers, and neither 7 is itself in A001045.
a(63) = 3, because the least number of Jacobsthal numbers that add up to 63 is obtained when we use A001045(6) = 21 three times, as 21+21+21 = 63. This is the first time this sequence differs from A265745.

Antti Karttunen, Table of n, a(n) for n = 0..87381

Cf. A001045, A130249, A147612, A372556, A372557, A372561.

Cf. also A265745.

up_to = 87381; \\ = A001045(18).
A001045(n) = (2^n - (-1)^n) / 3;
A130249(n) = (#binary(3*n+1)-1);
A372555_or_556list(up_to_n,return_556_instead) = { my(v372555 = vector(up_to_n), v372556 = vector(up_to_n)); v372555[1] = 1; v372556[1] = 2; for(n=2,#v372556, my(m=-1,mk=-1,s=A130249(n)); if(A001045(s)==n, v372555[n] = 1; v372556[n] = s, forstep(k=s, 1, -1, my(c=v372555[n-A001045(k)]); if(m<0 || cA001045(mk)])); if(return_556_instead,v372556,v372555); };
v372555 = A372555_or_556list(up_to,0);
A372555(n) = if(!n,n,v372555[n]);

;; An implementation of memoization-macro definec can be found for example in: http://oeis.org/wiki/Memoization
(definec (A001045 n) (if (<= n 1) n (+ (A001045 (- n 1)) (* 2 (A001045 (- n 2))))))
(define (A130249 n) (floor->exact (/ (log (+ 1 (* 3 n))) (log 2))))
(define (A147612 n) (if (<= n 1) 1 (if (= (A001045 (A130249 n)) n) 1 0)))
(definec (A372555 n) (if (<= n 1) n (+ 1 (A372555 (- n (A001045 (A372556 n)))))))
(definec (A372556 n) (let ((k (A130249 n))) (if (= 1 (A147612 n)) k (let loop ((k k) (m #f) (mk #f)) (cond ((zero? k) mk) (else (let* ((c (A372555 (- n (A001045 k))))) (if (or (not m) (< c m)) (loop (- k 1) c k) (loop (- k 1) m mk)))))))))

a(0) = 0, a(1) = 1; for n > 1, a(n) = 1 + a(n-A001045(A372556(n))).

cp's OEIS Frontend

A372558 Numbers k such that A130249(k) differs from A372556(k).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

PARI