[go: up one dir, main page]

login
Revision History for A280012 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) = least positive integer k such that sumdigits(k^2) = n*sumdigits(k).
(history; published version)
#49 by N. J. A. Sloane at Tue Apr 18 15:46:59 EDT 2017
STATUS

reviewed

approved

#48 by Michel Marcus at Sun Apr 16 07:59:25 EDT 2017
STATUS

proposed

reviewed

#47 by Joerg Arndt at Sun Apr 16 04:55:41 EDT 2017
STATUS

editing

proposed

#46 by Joerg Arndt at Sun Apr 16 04:55:28 EDT 2017
KEYWORD

nonn,base,more,new

STATUS

reviewed

editing

Discussion
Sun Apr 16
04:55
Joerg Arndt: Yes, keyword added.
#45 by Robert G. Wilson v at Sat Apr 15 19:49:20 EDT 2017
STATUS

proposed

reviewed

Discussion
Sun Apr 16
03:22
Peter Luschny: Is this a 'base' sequence?
#44 by David A. Corneth at Sat Apr 15 16:11:48 EDT 2017
STATUS

editing

proposed

#43 by David A. Corneth at Sat Apr 15 16:11:42 EDT 2017
CROSSREFS
STATUS

proposed

editing

#42 by David A. Corneth at Sat Apr 15 15:58:13 EDT 2017
STATUS

editing

proposed

#41 by David A. Corneth at Sat Apr 15 15:58:07 EDT 2017
COMMENTS

a(n) exists for any n, since sum_{i=0..n-1} 10^(2^i-1) is an integer with the required property, having n digits 1, with its square having n digits 1 at positions 2^i-1 (n>=i>=1), and n(n-1)/2 digits 2 at positions 2^i+2^j-1 (n>=i>j>=0 i.e. at positions 1<=k<2^(n+1) for k in A099628).

#40 by David A. Corneth at Sat Apr 15 15:56:43 EDT 2017
COMMENTS

a(n) exists for any n, since sum_{i=0..n-1} 10^(2^i-1) is an integer with the required property, having n digits 1, with its square having n digits 1 at positions 2^i-1 (n>=i>=1), and n(n-1)/2 digits 2 at positions 2^i+2^j-1 (n>=i>j>=0 i.e. for k in A099628).

STATUS

proposed

editing