

A276581


After a(0)=0, each n occurs A261224(n) times.


3



0, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 18
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS

Auxiliary function for computing A276582 & A276583.


LINKS

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


MATHEMATICA

Table[Table[n, {1 + Length@ NestWhileList[#  Block[{m = #, c = 1}, While[a = (#  Floor[Sqrt@ #]^2) &@ m; a != 0, c++; m = a]; c] &, ((n + 1)^2)  1, # != n^2  1 &]}], {n, 0, 18}] // Flatten (* Michael De Vlieger, Sep 08 2016 *)


PROG

(Scheme) (define (A276581 n) (let loop ((k 0)) (if (>= (A261223 (+ 1 k)) n) k (loop (+ 1 k)))))


CROSSREFS

Cf. A261223, A261224, A276582, A276583.
Sequence in context: A055086 A001462 A082462 * A005041 A030530 A084500
Adjacent sequences: A276578 A276579 A276580 * A276582 A276583 A276584


KEYWORD

nonn


AUTHOR

Antti Karttunen, Sep 07 2016


STATUS

approved



