A100283 a(n) = floor(p*(n+1)) - floor(p*(n)) - 1 where p = Padovan plastic number = 1.324718... (cf. A060006).

0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1

Offset

0,1

Comments

A rabbit-like sequence generated by the Padovan plastic number.

The well-known rabbit sequence is generated by taking the difference between the nearest integer less than phi*(n+1) minus the nearest integer less than phi*(n). If this value is 2, then the n-th rabbit sequence value is one. If this value is 1, the n-th rabbit sequence is 0. The sequence given is calculated in a similar manner, but using the plastic constant = 1.324717957244... instead of phi = 1.618033... = (1+sqrt(5))/2. It is 0001 followed by 11 copies of 001 followed by 0001 followed by 12 copies of 001 followed by 11 copies of 001 followed by similar patterns of 0001 followed by n copies of 001 where n is 11 or 12.

References

Midhat J. Gazale, Gnomon: From Pharaohs to Fractals, Princeton University Press, 1999

Links

Table of n, a(n) for n=0..104.

Ian Stewart, Tales of a Neglected Number, Mathematical Recreations, Scientific American, Vol. 274, No. 6 (1996), pp. 102-103.

Prog

(PARI) p=(sqrt(23/108)+.5)^(1/3) + (abs( sqrt(23/108) -.5))^(1/3); for(n = 0, n = 200, r = floor(p*(n+1)) - floor(p*n) -1; print (r ))

Crossrefs

Cf. A000931, A005614, A060006.

Sequence in context: A125117 A144603 A163581 * A320927 A134391 A102215

Adjacent sequences: A100280 A100281 A100282 * A100284 A100285 A100286

Keyword

nonn

Author

John Lien, Dec 28 2004

Extensions

Partially edited by N. J. A. Sloane, Jun 13 2007

Status

approved