|
Search: id:A056753
|
|
|
| A056753 |
|
Only odd numbers occur and for all k there are k numbers between any two successive occurrences of k. |
|
+0
5
|
|
| 1, 3, 1, 5, 1, 3, 1, 7, 1, 3, 1, 9, 1, 3, 1, 7, 1, 3, 1, 11, 1, 3, 1, 7, 1, 3, 1, 13, 1, 3, 1, 7, 1, 3, 1, 15, 1, 3, 1, 7, 1, 3, 1, 17, 1, 3, 1, 7, 1, 3, 1, 15, 1, 3, 1, 7, 1, 3, 1, 19, 1, 3, 1, 7, 1, 3, 1, 15, 1, 3, 1, 7, 1, 3, 1, 21, 1, 3, 1, 7, 1, 3, 1, 15, 1, 3, 1, 7, 1, 3, 1, 23, 1, 3, 1, 7, 1, 3, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Only the numbers 2^m - 1 occur more than once.
a(A005843(n))=1; a(A016813(n))=3; a(A004771(n))=7; a(A008598(n)+35)=15; a(A008598(n)+155)=31. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 23 2009]
|
|
LINKS
|
R. Zumkeller, Table of n, a(n) for n = 0..10000 [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 23 2009]
|
|
FORMULA
|
Let x=a(n-A164632(n)), a(n) = if (x occured exactly once so far) then x+2 else x. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 23 2009]
|
|
PROGRAM
|
Contribution from Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 23 2009: (Start)
(Other) PolyML (the leading dots are just for readability):
fun A056753(n) =
... let fun f(i, x, y, z) =
........... if i = n
............ then if x = 1
.................. then A056753(n - z) + 2
.................. else A056753(n - z)
............ else if x = 1
.................. then if y = 1
........................ then f(i + 1, 2*z, z, 2*z)
........................ else f(i + 1, z, y - 1, z)
.................. else f(i + 1, x - 1, y, z)
.... in if n = 0
........ then 1
........ else f(1, 1, 1, 1)
... end; (End)
|
|
CROSSREFS
|
Adjacent sequences: A056750 A056751 A056752 this_sequence A056754 A056755 A056756
Sequence in context: A085407 A016475 A037227 this_sequence A154723 A114567 A001051
|
|
KEYWORD
|
nice,nonn
|
|
AUTHOR
|
Claude Lenormand (claude.lenormand(AT)free.fr), Jan 19 2001
|
|
|
Search completed in 0.002 seconds
|
