a(1) = 1; for n > 1, a(n) = largest proper divisor of n.
1, 1, 1, 2, 1, 3, 1, 4, 3, 5, 1, 6, 1, 7, 5, 8, 1, 9, 1, 10, 7, 11, 1, 12, 5, 13, 9, 14, 1, 15, 1
5 seqfan posts
Tue Jan 25 10:23:09 CET 2011 [seqfan] Re: OEISWiki : decomposition into weight * level + jump
Sat Apr 11 20:42:33 CEST 2009 [seqfan] Re: 2^n - 2
Sat Apr 11 18:54:34 CEST 2009 [seqfan] Re: 2^n - 2
Sat Apr 11 18:38:03 CEST 2009 [seqfan] Re: 2^n - 2
Sat Apr 11 18:32:29 CEST 2009 [seqfan] 2^n - 2
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.