A277896 a(n) = the least k > n for which A048675(k) = A048675(n), 0 if no such number exists (when n is a power of 2).

0, 0, 4, 0, 9, 8, 25, 0, 12, 18, 49, 16, 121, 50, 20, 0, 169, 24, 289, 27, 28, 98, 361, 32, 45, 242, 36, 75, 529, 40, 841, 0, 44, 338, 63, 48, 961, 578, 52, 54, 1369, 56, 1681, 147, 60, 722, 1849, 64, 175, 90, 68, 363, 2209, 72, 99, 150, 76, 1058, 2809, 80, 3481, 1682, 84, 0, 117, 88, 3721, 507, 92, 126, 4489, 96, 5041, 1922, 100, 867, 275

Offset: 1

Author

Antti Karttunen, Nov 15 2016

Keywords

• nonn

Comments

Apart from zeros, a permutation of A013929.

Links

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

Crossrefs

Cf. A000079, A013929, A048675, A209229, A277886, A277893, A277905.

Numbers not in this sequence: A005117 (A019565).

Programs

Scheme

(define (A277896 n) (if (= 1 (A209229 n)) 0 (let ((v (A048675 n))) (let loop ((k (+ 1 n))) (if (= (A048675 k) v) k (loop (+ 1 k)))))))

Formula

a(A000079(n)) = 0.

For all n, except powers of two, a(n) >= A277893(n).