Search a number
Perrin numbers
Numbers defined by the recurrence P(0)=3, P(1)=0, P(2)=2 and P(n) = P(n-2) + P(n-3). more

The Perrin 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 2 to 2.2⋅1012212).

n\r 0  1 
24285857142 2 
3307702307646154 3 
414286285722857228570 4 
5208358333333341666620832 5 
613188131871978117582988926373 6 
712500125001250116667124991666816665 7 
8357210714178581071410714178581071417856 8 
976935128179501538551281794876921282010256 9 
1089324762142849523892811903357119050714311904 10 
1191671416411669833411666916641699168666666669165

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.