|
Search: id:A042968
|
|
| |
|
| 1, 2, 3, 5, 6, 7, 9, 10, 11, 13, 14, 15, 17, 18, 19, 21, 22, 23, 25, 26, 27, 29, 30, 31, 33, 34, 35, 37, 38, 39, 41, 42, 43, 45, 46, 47, 49, 50, 51, 53, 54, 55, 57, 58, 59, 61, 62, 63, 65, 66, 67, 69, 70, 71, 73, 74, 75
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
A064680(A064680(a(n))) = a(n) - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 19 2001
More generally the sequence of numbers not divisible by some fixed integer m>=2 is given by a(n,m)=n-1+floor((n+m-2)/(m-1)). [From Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 11 2009]
|
|
FORMULA
|
a(n)=4+a(n-3).
G.f.: (1+x+x^2+x^3)/((1-x)*(1-x^3)) - Michael Somos Jan 12 2000.
Nearest integer to sum(k>n, 1/k^4)/sum(k>n, 1/k^5) - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 12 2003
a(n)=n-1+floor((n+2)/3) [From Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 11 2009]
|
|
PROGRAM
|
(PARI) a(n)=1+n+n\3
(PARI) a(n)=n-1+floor((n+2)/3) [From Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 11 2009]
|
|
CROSSREFS
|
Cf. A001651.
Sequence in context: A164087 A059531 A039053 this_sequence A059557 A048103 A092418
Adjacent sequences: A042965 A042966 A042967 this_sequence A042969 A042970 A042971
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
