login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129971 a(n) = A129968(n)^2. 2
1, 4, 9, 1, 4, 9, 16, 4, 9, 16, 9, 16, 1, 4, 9, 16, 4, 9, 16, 25, 9, 16, 25, 16, 4, 9, 16, 9, 16, 25, 16, 25, 9, 16, 16, 25, 1, 4, 9, 16, 4, 9, 16, 25, 9, 16, 25, 16, 25, 4, 9, 16, 25, 9, 16, 25, 36, 16, 25, 36, 25, 9, 16, 25, 16, 25, 36, 25, 16, 25, 4, 9, 16, 9, 16, 25, 16, 25, 36, 9, 16, 25 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Also a(n) = sum of digits of A129967(n)^2.

LINKS

T. D. Noe, Table of n, a(n) for n=1..5000

CROSSREFS

Sequence in context: A002993 A011290 A196502 * A007892 A010297 A001191

Adjacent sequences:  A129968 A129969 A129970 * A129972 A129973 A129974

KEYWORD

nonn,base

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jun 13 2007, Oct 07 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 10:05 EST 2012. Contains 206009 sequences.