|
Search: id:A047264
|
|
|
| A047264 |
|
Numbers that are congruent to {0, 5} mod 6. |
|
+0
2
|
|
| 0, 5, 6, 11, 12, 17, 18, 23, 24, 29, 30, 35, 36, 41, 42, 47, 48, 53, 54, 59, 60, 65, 66, 71, 72, 77, 78, 83, 84, 89, 90, 95, 96, 101, 102, 107, 108, 113, 114, 119, 120, 125, 126, 131, 132, 137, 138, 143, 144, 149
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Values of n for which sum(k*fibonacci(k),k=1..n) is even (n>0). Example: 5 is in the sequence because sum(k*fibonacci(k),k=1..5)=1*1+2*1+3*2+4*3+5*5=46. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 28 2005
|
|
REFERENCES
|
H. Freitag, Problem B-776, Fibonacci Quarterly, 32 (1994), no. 5, ibid. 34 (1996), no. 1, p. 85.
|
|
FORMULA
|
Let b(1)=0, b(2)=1 and b(k+2)=b(k+1)-b(k)+k^2; then a(n) is the sequence of integers such that b(a(n)) is a square = (a(n)+1)^2 - Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 04 2002
|
|
MAPLE
|
c:=proc(n) if n mod 6 = 0 or n mod 6 = 5 then n else fi end: seq(c(n), n=0..149); (Deutsch)
|
|
CROSSREFS
|
Adjacent sequences: A047261 A047262 A047263 this_sequence A047265 A047266 A047267
Sequence in context: A139071 A092296 A046608 this_sequence A129286 A083450 A136974
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
