[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A274062 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A274062 Even numbers such that the sum of the odd divisors is a Fibonacci number F and the sum of the even divisors is 2F.
(history; published version)
#16 by N. J. A. Sloane at Fri Jun 17 00:44:36 EDT 2016
STATUS

proposed

approved

#15 by Michel Marcus at Tue Jun 14 06:10:36 EDT 2016
STATUS

editing

proposed

Discussion
Tue Jun 14 11:24
Michel Lagneau: Thanks Michel !
#14 by Michel Marcus at Tue Jun 14 06:10:20 EDT 2016
KEYWORD

nonn,more,changed

Discussion
Tue Jun 14 06:10
Michel Marcus: I've got more terms behind
#13 by Michel Marcus at Tue Jun 14 06:09:58 EDT 2016
DATA

2, 14, 18, 230, 238, 4958, 53430, 57930, 64506, 65586, 68226, 70730, 77270, 78638, 81926, 84986, 88826, 90446, 91306, 1006350, 1248054, 1341950, 18177726, 19033854, 19603430, 21044030, 22356798, 22395522, 22876730, 23954170, 24241966, 24840710, 24883910, 25285666, 25306246

EXTENSIONS

a(23)-a(35) from Michel Marcus, Jun 14 2016

STATUS

proposed

editing

#12 by Michel Marcus at Thu Jun 09 10:52:32 EDT 2016
STATUS

editing

proposed

Discussion
Thu Jun 09 10:54
Michel Marcus: Up to where did you search ?
11:33
Michel Lagneau: No other terms < 2*10^6.
12:08
Michel Marcus: No other terms < 10^7
12:28
Michel Lagneau: OK Michel.
#11 by Michel Marcus at Thu Jun 09 10:49:03 EDT 2016
PROG

(PARI) isok(n) = sod = sumdiv(n, d, d*(d % 2)); (2*sod == sumdiv(n, d, d*(1-(d % 2)))) && (issquare(5*sod^2-4) || issquare(5*sod^2+4)); \\ Michel Marcus, Jun 09 2016

STATUS

proposed

editing

#10 by Michel Marcus at Thu Jun 09 10:37:13 EDT 2016
STATUS

editing

proposed

#9 by Michel Marcus at Thu Jun 09 10:33:15 EDT 2016
COMMENTS

The sequence is generalizable with the following definition: even numbers such that the sum of the odd divisors is a Fibonacci number F and the sum of the even divisors is (2^k -2)*F = A000918(k)*F with k>1. The corresponding sequences b(n,k) are of the form b(n,k) = a(n)*2^(k-2) where a(n) is the primitive sequence.

EXAMPLE

18 is in the sequence because the: its divisors are {1, 2, 3, 6, 9, 18}, }; the sum of theits odd divisors is 1 + 3 + 9 = 13 is , a Fibonacci number , and the sum of theits even divisors is 2 + 6 + 18 = 26 = 2*13.

STATUS

proposed

editing

#8 by Michael De Vlieger at Thu Jun 09 09:58:13 EDT 2016
STATUS

editing

proposed

#7 by Michael De Vlieger at Thu Jun 09 09:58:09 EDT 2016
MATHEMATICA

t = Fibonacci@ Range@ 40; Select[Range[2, 2*10^6, 4], Function[d, And[Total@ Select[d, EvenQ] == 2 #, MemberQ[t, #]] &@ Total@ Select[d, OddQ]]@ Divisors@ # &] (* Michael De Vlieger, Jun 09 2016 *)

STATUS

proposed

editing

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 11:15 EDT 2024. Contains 375512 sequences. (Running on oeis4.)