Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083475
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083475 Consider the set of all the numbers n*k where 1 <= k <= n. Then a(n) = number of palindromic members of this set. +0
2
1, 2, 3, 2, 1, 1, 1, 1, 1, 0, 10, 0, 0, 0, 0, 0, 1, 1, 2, 0, 1, 6, 2, 0, 2, 2, 0, 2, 3, 0, 2, 0, 5, 2, 2, 2, 10, 2, 2, 0, 1, 1, 1, 4, 1, 2, 3, 1, 2, 0, 1, 1, 5, 0, 1, 1, 3, 4, 1, 0, 0, 2, 2, 1, 1, 6, 1, 2, 3, 0, 0, 0, 2, 6, 1, 0, 12, 2, 1, 0, 0, 1, 1, 2, 1, 0, 1, 9, 1, 0, 8, 1, 1, 1, 1, 4, 1, 1, 10, 0, 19, 0, 2, 1 (list; graph; listen)
OFFSET

1,2

COMMENT

a(10k) = 0.

EXAMPLE

a(22) = 6, and the palindromes are 22,44,66,88,242,484.

a(26) = 2, and the palindromes are 494 and 676.

CROSSREFS

Cf. A083476.

Sequence in context: A108619 A091327 A110540 this_sequence A122402 A008406 A039735

Adjacent sequences: A083472 A083473 A083474 this_sequence A083476 A083477 A083478

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy and Meenakshi Sirkanth (amarnath_murthy(AT)yahoo.com), May 03 2003

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Nov 15 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research