|
Search: id:A082447
|
|
|
| A082447 |
|
a(n) = the number k such that s(k)=0 where s(0)=n and s(i)=s(i-1)-(s(i-1) modulo i). |
|
+0
6
|
|
| 1, 2, 2, 3, 3, 4, 4, 4, 4, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n+1) = number of Mancala numbers <= n, see A007952; n occurs A028913(n-1) times consecutively. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 21 2008
a(n) = number of ones <= n in A130747; see also A002491. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 01 2009]
|
|
LINKS
|
R. Zumkeller, Table of n, a(n) for n = 1..10000 [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 01 2009]
|
|
FORMULA
|
Conjecture : a(n) = sqrt(Pi*n) + O(1)
|
|
EXAMPLE
|
If n=6 : s(0)=6, s(1)=6-6 mod 2=6, s(2)=6-6 mod 3=6, s(3)=6-6 mod 4=6-2=4, s(4)=4-4 mod 5=0, hence a(6)=4.
If s(0)=4, 4 ->4-4 mod 1=4 ->4-4 mod 2=4 ->4-4 mod 3=3 ->3-3 mod 4=0, hence s(4)=0 and a(4)=4.
|
|
PROGRAM
|
(PARI) a(n)=if(n<1, 0, s=n; c=1; while(s-s%c>0, s=s-s%c; c++); c)
|
|
CROSSREFS
|
A073047(n) - 1.
Cf. A140060, A140061.
Sequence in context: A066063 A123087 A071868 this_sequence A139789 A000720 A070549
Adjacent sequences: A082444 A082445 A082446 this_sequence A082448 A082449 A082450
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 25 2003
|
|
|
Search completed in 0.002 seconds
|
