COOKIE CONSENT: By continuing to browse my site you agree to its use of cookies. OK or Tell me more
Search a number
tetranacci numbers
Fibonacci-like numbers defined by the recurrence T(0)=0, T(1)=T(2)=1, T(3)=2 and T(n) = T(n-1) + T(n-2) + T(n-3) + T(n-4). more

The tetranacci numbers up to 1015 :

Distribution of the remainders when the numbers in this family are divided by n=2, 3,..., 11. (I took into account 100000 values, from 1 to 2⋅1028500).

n\r 0  1 
26000040000 2 
3346143077134615 3 
450000300001000010000 4 
52307619230192271923419233 5 
6207681230820769138461846313846 6 
714327146261666412574125751257216662 7 
840000200001000001000010000010000 8 
91538414104115397692102571153811538641011538 9 
10138447693115377692115409232115377690115427693 10 
1191651416783328335916666699999833310833416710834

A pictorial representation of the table above
motab
Imagine to divide the members of this family by a number n and compute the remainders. Should they be uniformly distributed, each remainder from 0 to n-1 would be obtained in about (1/n)-th of the cases. This outcome is represented by a white square. Reddish (resp. bluish) squares represent remainders which appear more (resp. less) frequently than 1/n.