A152306 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A152306

a(n) = floor(log(2)*((1 + sqrt(3))/2)^n) mod 10.

0, 0, 1, 1, 2, 3, 4, 6, 8, 1, 5, 1, 9, 9, 4, 4, 1, 9, 0, 9, 4, 4, 2, 4, 5, 7, 5, 9, 2, 6, 7, 5, 9, 2, 2, 4, 0, 2, 2, 8, 5, 4, 7, 9, 8, 3, 8, 4, 9, 1, 6, 1, 4, 5, 3, 0, 7, 2, 6, 3, 6, 8, 1, 5, 1, 3, 9, 6, 0, 9, 9, 8, 3, 8, 5, 9, 1, 1, 7, 7, 1, 5, 5, 8, 6, 5, 3, 6, 8, 1, 0, 0, 6, 6, 9, 8, 2, 2, 8, 9, 8

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,5

LINKS

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

MATHEMATICA

a[n_] = Log[2]*((1 + Sqrt[3])/2)^n;

Table[Mod[Floor[a[n]], 10], {n, 0, 100}]

CROSSREFS

Sequence in context: A036413 A069912 A351329 * A120817 A327887 A339361

Adjacent sequences: A152303 A152304 A152305 * A152307 A152308 A152309

KEYWORD

nonn,base,easy,less

AUTHOR

Roger L. Bagula, Dec 02 2008

STATUS

approved